fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S32C05

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9903.876 3466011.00 10705120.00 2892.60 T?FFF????F??FF?T 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-167856419600913.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 MultiCrashLeafsetExtension-PT-S32C05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419600913
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Feb 26 03:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K Feb 26 03:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22M 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 MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679661161151

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=MultiCrashLeafsetExtension-PT-S32C05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 12:32:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 12:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 12:32:43] [INFO ] Load time of PNML (sax parser for PT used): 898 ms
[2023-03-24 12:32:43] [INFO ] Transformed 20498 places.
[2023-03-24 12:32:43] [INFO ] Transformed 31713 transitions.
[2023-03-24 12:32:43] [INFO ] Parsed PT model containing 20498 places and 31713 transitions and 126502 arcs in 1121 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 104 out of 20498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20498/20498 places, 31713/31713 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 20453 transition count 31713
Applied a total of 45 rules in 2248 ms. Remains 20453 /20498 variables (removed 45) and now considering 31713/31713 (removed 0) transitions.
[2023-03-24 12:32:46] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
// Phase 1: matrix 30657 rows 20453 cols
[2023-03-24 12:32:49] [INFO ] Computed 1498 place invariants in 3390 ms
[2023-03-24 12:32:51] [INFO ] Implicit Places using invariants in 5370 ms returned []
Implicit Place search using SMT only with invariants took 5396 ms to find 0 implicit places.
[2023-03-24 12:32:51] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
[2023-03-24 12:32:51] [INFO ] Invariant cache hit.
[2023-03-24 12:32:53] [INFO ] Dead Transitions using invariants and state equation in 1958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20453/20498 places, 31713/31713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9621 ms. Remains : 20453/20498 places, 31713/31713 transitions.
Support contains 104 out of 20453 places after structural reductions.
[2023-03-24 12:32:55] [INFO ] Flatten gal took : 1283 ms
[2023-03-24 12:32:56] [INFO ] Flatten gal took : 863 ms
[2023-03-24 12:32:58] [INFO ] Input system was already deterministic with 31713 transitions.
Support contains 101 out of 20453 places (down from 104) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 59) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Running SMT prover for 52 properties.
[2023-03-24 12:33:00] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
[2023-03-24 12:33:00] [INFO ] Invariant cache hit.
[2023-03-24 12:33:15] [INFO ] [Real]Absence check using 63 positive place invariants in 325 ms returned sat
[2023-03-24 12:33:16] [INFO ] [Real]Absence check using 63 positive and 1435 generalized place invariants in 1060 ms returned sat
[2023-03-24 12:33:16] [INFO ] After 16629ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:51
[2023-03-24 12:33:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 250 ms returned sat
[2023-03-24 12:33:31] [INFO ] [Nat]Absence check using 63 positive and 1435 generalized place invariants in 1034 ms returned sat
[2023-03-24 12:33:41] [INFO ] After 4184ms SMT Verify possible using state equation in natural domain returned unsat :30 sat :21
[2023-03-24 12:33:41] [INFO ] State equation strengthened by 10210 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 12:33:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 12:33:41] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:51
Fused 52 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 41 out of 20453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Graph (complete) has 72513 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.75 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5237 transitions
Trivial Post-agglo rules discarded 5237 transitions
Performed 5237 trivial Post agglomeration. Transition count delta: 5237
Iterating post reduction 0 with 5237 rules applied. Total rules applied 5238 place count 20452 transition count 26476
Reduce places removed 5237 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 5265 rules applied. Total rules applied 10503 place count 15215 transition count 26448
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 10531 place count 15187 transition count 26448
Performed 329 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 329 Pre rules applied. Total rules applied 10531 place count 15187 transition count 26119
Deduced a syphon composed of 329 places in 25 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 11189 place count 14858 transition count 26119
Discarding 4923 places :
Symmetric choice reduction at 3 with 4923 rule applications. Total rules 16112 place count 9935 transition count 21196
Iterating global reduction 3 with 4923 rules applied. Total rules applied 21035 place count 9935 transition count 21196
Discarding 961 places :
Symmetric choice reduction at 3 with 961 rule applications. Total rules 21996 place count 8974 transition count 16391
Iterating global reduction 3 with 961 rules applied. Total rules applied 22957 place count 8974 transition count 16391
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23023 place count 8941 transition count 16358
Free-agglomeration rule (complex) applied 600 times.
Iterating global reduction 3 with 600 rules applied. Total rules applied 23623 place count 8941 transition count 19490
Reduce places removed 600 places and 0 transitions.
Iterating post reduction 3 with 600 rules applied. Total rules applied 24223 place count 8341 transition count 19490
Partial Free-agglomeration rule applied 329 times.
Drop transitions removed 329 transitions
Iterating global reduction 4 with 329 rules applied. Total rules applied 24552 place count 8341 transition count 19490
Applied a total of 24552 rules in 14472 ms. Remains 8341 /20453 variables (removed 12112) and now considering 19490/31713 (removed 12223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14474 ms. Remains : 8341/20453 places, 19490/31713 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 11897 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{8=1}
Probabilistic random walk after 11897 steps, saw 5608 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :1
Running SMT prover for 19 properties.
[2023-03-24 12:34:00] [INFO ] Flow matrix only has 17925 transitions (discarded 1565 similar events)
// Phase 1: matrix 17925 rows 8341 cols
[2023-03-24 12:34:01] [INFO ] Computed 1497 place invariants in 946 ms
[2023-03-24 12:34:04] [INFO ] After 2726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-24 12:34:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-24 12:34:07] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 537 ms returned sat
[2023-03-24 12:34:29] [INFO ] After 19539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-24 12:34:29] [INFO ] State equation strengthened by 10098 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 12:34:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 12:34:29] [INFO ] After 25250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 36 out of 8341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8341/8341 places, 19490/19490 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8341 transition count 19488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8339 transition count 19488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 8338 transition count 19487
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 8338 transition count 19487
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 8338 transition count 19541
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 8336 transition count 19541
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 8335 transition count 19540
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 8335 transition count 19540
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 8335 transition count 19540
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 8333 transition count 19538
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 8333 transition count 19538
Applied a total of 18 rules in 9001 ms. Remains 8333 /8341 variables (removed 8) and now considering 19538/19490 (removed -48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9001 ms. Remains : 8333/8341 places, 19538/19490 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-24 12:34:39] [INFO ] Flow matrix only has 17973 transitions (discarded 1565 similar events)
// Phase 1: matrix 17973 rows 8333 cols
[2023-03-24 12:34:40] [INFO ] Computed 1497 place invariants in 842 ms
[2023-03-24 12:34:42] [INFO ] After 2394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-24 12:34:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 138 ms returned sat
[2023-03-24 12:34:45] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 521 ms returned sat
[2023-03-24 12:35:07] [INFO ] After 20114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-24 12:35:07] [INFO ] State equation strengthened by 10154 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 12:35:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 12:35:07] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 33 out of 8333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8333/8333 places, 19538/19538 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8333 transition count 19537
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8332 transition count 19537
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 8332 transition count 19537
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 8329 transition count 19534
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 8329 transition count 19534
Applied a total of 11 rules in 4843 ms. Remains 8329 /8333 variables (removed 4) and now considering 19534/19538 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4843 ms. Remains : 8329/8333 places, 19534/19538 transitions.
Successfully simplified 30 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 12:35:13] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-24 12:35:13] [INFO ] Flatten gal took : 743 ms
[2023-03-24 12:35:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 12:35:14] [INFO ] Flatten gal took : 837 ms
[2023-03-24 12:35:15] [INFO ] Input system was already deterministic with 31713 transitions.
Support contains 29 out of 20453 places (down from 51) after GAL structural reductions.
Computed a total of 14437 stabilizing places and 19744 stable transitions
Graph (complete) has 93541 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.112 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Graph (complete) has 93541 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.91 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5279 transitions
Trivial Post-agglo rules discarded 5279 transitions
Performed 5279 trivial Post agglomeration. Transition count delta: 5279
Iterating post reduction 0 with 5279 rules applied. Total rules applied 5280 place count 20452 transition count 26434
Reduce places removed 5279 places and 0 transitions.
Iterating post reduction 1 with 5279 rules applied. Total rules applied 10559 place count 15173 transition count 26434
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 330 Pre rules applied. Total rules applied 10559 place count 15173 transition count 26104
Deduced a syphon composed of 330 places in 20 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 2 with 660 rules applied. Total rules applied 11219 place count 14843 transition count 26104
Discarding 4949 places :
Symmetric choice reduction at 2 with 4949 rule applications. Total rules 16168 place count 9894 transition count 21155
Iterating global reduction 2 with 4949 rules applied. Total rules applied 21117 place count 9894 transition count 21155
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21117 place count 9894 transition count 21146
Deduced a syphon composed of 9 places in 16 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 21135 place count 9885 transition count 21146
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 22124 place count 8896 transition count 16201
Iterating global reduction 2 with 989 rules applied. Total rules applied 23113 place count 8896 transition count 16201
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 23179 place count 8863 transition count 16168
Applied a total of 23179 rules in 8407 ms. Remains 8863 /20453 variables (removed 11590) and now considering 16168/31713 (removed 15545) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8408 ms. Remains : 8863/20453 places, 16168/31713 transitions.
[2023-03-24 12:35:24] [INFO ] Flatten gal took : 335 ms
[2023-03-24 12:35:25] [INFO ] Flatten gal took : 383 ms
[2023-03-24 12:35:25] [INFO ] Input system was already deterministic with 16168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Graph (complete) has 93541 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.35 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5276 transitions
Trivial Post-agglo rules discarded 5276 transitions
Performed 5276 trivial Post agglomeration. Transition count delta: 5276
Iterating post reduction 0 with 5276 rules applied. Total rules applied 5277 place count 20452 transition count 26437
Reduce places removed 5276 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5278 rules applied. Total rules applied 10555 place count 15176 transition count 26435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10557 place count 15174 transition count 26435
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 330 Pre rules applied. Total rules applied 10557 place count 15174 transition count 26105
Deduced a syphon composed of 330 places in 21 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 3 with 660 rules applied. Total rules applied 11217 place count 14844 transition count 26105
Discarding 4946 places :
Symmetric choice reduction at 3 with 4946 rule applications. Total rules 16163 place count 9898 transition count 21159
Iterating global reduction 3 with 4946 rules applied. Total rules applied 21109 place count 9898 transition count 21159
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 21109 place count 9898 transition count 21153
Deduced a syphon composed of 6 places in 16 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21121 place count 9892 transition count 21153
Discarding 986 places :
Symmetric choice reduction at 3 with 986 rule applications. Total rules 22107 place count 8906 transition count 16223
Iterating global reduction 3 with 986 rules applied. Total rules applied 23093 place count 8906 transition count 16223
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23159 place count 8873 transition count 16190
Applied a total of 23159 rules in 8030 ms. Remains 8873 /20453 variables (removed 11580) and now considering 16190/31713 (removed 15523) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8031 ms. Remains : 8873/20453 places, 16190/31713 transitions.
[2023-03-24 12:35:34] [INFO ] Flatten gal took : 333 ms
[2023-03-24 12:35:34] [INFO ] Flatten gal took : 381 ms
[2023-03-24 12:35:35] [INFO ] Input system was already deterministic with 16190 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20452 transition count 31713
Applied a total of 1 rules in 1535 ms. Remains 20452 /20453 variables (removed 1) and now considering 31713/31713 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1536 ms. Remains : 20452/20453 places, 31713/31713 transitions.
[2023-03-24 12:35:37] [INFO ] Flatten gal took : 714 ms
[2023-03-24 12:35:38] [INFO ] Flatten gal took : 806 ms
[2023-03-24 12:35:40] [INFO ] Input system was already deterministic with 31713 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20452 transition count 31713
Applied a total of 1 rules in 1556 ms. Remains 20452 /20453 variables (removed 1) and now considering 31713/31713 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1557 ms. Remains : 20452/20453 places, 31713/31713 transitions.
[2023-03-24 12:35:42] [INFO ] Flatten gal took : 707 ms
[2023-03-24 12:35:43] [INFO ] Flatten gal took : 793 ms
[2023-03-24 12:35:44] [INFO ] Input system was already deterministic with 31713 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20452 transition count 31713
Applied a total of 1 rules in 1716 ms. Remains 20452 /20453 variables (removed 1) and now considering 31713/31713 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 20452/20453 places, 31713/31713 transitions.
[2023-03-24 12:35:47] [INFO ] Flatten gal took : 775 ms
[2023-03-24 12:35:48] [INFO ] Flatten gal took : 871 ms
[2023-03-24 12:35:49] [INFO ] Input system was already deterministic with 31713 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Graph (complete) has 93541 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.33 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5279 transitions
Trivial Post-agglo rules discarded 5279 transitions
Performed 5279 trivial Post agglomeration. Transition count delta: 5279
Iterating post reduction 0 with 5279 rules applied. Total rules applied 5280 place count 20452 transition count 26434
Reduce places removed 5279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5280 rules applied. Total rules applied 10560 place count 15173 transition count 26433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10561 place count 15172 transition count 26433
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 330 Pre rules applied. Total rules applied 10561 place count 15172 transition count 26103
Deduced a syphon composed of 330 places in 22 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 3 with 660 rules applied. Total rules applied 11221 place count 14842 transition count 26103
Discarding 4949 places :
Symmetric choice reduction at 3 with 4949 rule applications. Total rules 16170 place count 9893 transition count 21154
Iterating global reduction 3 with 4949 rules applied. Total rules applied 21119 place count 9893 transition count 21154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 21119 place count 9893 transition count 21145
Deduced a syphon composed of 9 places in 17 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 21137 place count 9884 transition count 21145
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 22126 place count 8895 transition count 16200
Iterating global reduction 3 with 989 rules applied. Total rules applied 23115 place count 8895 transition count 16200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23181 place count 8862 transition count 16167
Applied a total of 23181 rules in 8157 ms. Remains 8862 /20453 variables (removed 11591) and now considering 16167/31713 (removed 15546) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8157 ms. Remains : 8862/20453 places, 16167/31713 transitions.
[2023-03-24 12:35:58] [INFO ] Flatten gal took : 339 ms
[2023-03-24 12:35:59] [INFO ] Flatten gal took : 398 ms
[2023-03-24 12:35:59] [INFO ] Input system was already deterministic with 16167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20452 transition count 31713
Applied a total of 1 rules in 1529 ms. Remains 20452 /20453 variables (removed 1) and now considering 31713/31713 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1529 ms. Remains : 20452/20453 places, 31713/31713 transitions.
[2023-03-24 12:36:02] [INFO ] Flatten gal took : 734 ms
[2023-03-24 12:36:02] [INFO ] Flatten gal took : 840 ms
[2023-03-24 12:36:04] [INFO ] Input system was already deterministic with 31713 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20453/20453 places, 31713/31713 transitions.
Graph (complete) has 93541 edges and 20453 vertex of which 20452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5280 transitions
Trivial Post-agglo rules discarded 5280 transitions
Performed 5280 trivial Post agglomeration. Transition count delta: 5280
Iterating post reduction 0 with 5280 rules applied. Total rules applied 5281 place count 20452 transition count 26433
Reduce places removed 5280 places and 0 transitions.
Iterating post reduction 1 with 5280 rules applied. Total rules applied 10561 place count 15172 transition count 26433
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 330 Pre rules applied. Total rules applied 10561 place count 15172 transition count 26103
Deduced a syphon composed of 330 places in 21 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 2 with 660 rules applied. Total rules applied 11221 place count 14842 transition count 26103
Discarding 4950 places :
Symmetric choice reduction at 2 with 4950 rule applications. Total rules 16171 place count 9892 transition count 21153
Iterating global reduction 2 with 4950 rules applied. Total rules applied 21121 place count 9892 transition count 21153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21121 place count 9892 transition count 21143
Deduced a syphon composed of 10 places in 15 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 21141 place count 9882 transition count 21143
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 22131 place count 8892 transition count 16193
Iterating global reduction 2 with 990 rules applied. Total rules applied 23121 place count 8892 transition count 16193
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 23187 place count 8859 transition count 16160
Applied a total of 23187 rules in 8164 ms. Remains 8859 /20453 variables (removed 11594) and now considering 16160/31713 (removed 15553) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8165 ms. Remains : 8859/20453 places, 16160/31713 transitions.
[2023-03-24 12:36:12] [INFO ] Flatten gal took : 345 ms
[2023-03-24 12:36:13] [INFO ] Flatten gal took : 398 ms
[2023-03-24 12:36:14] [INFO ] Input system was already deterministic with 16160 transitions.
[2023-03-24 12:36:15] [INFO ] Flatten gal took : 801 ms
[2023-03-24 12:36:15] [INFO ] Flatten gal took : 836 ms
[2023-03-24 12:36:15] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-24 12:36:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20453 places, 31713 transitions and 126457 arcs took 120 ms.
Total runtime 213352 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/500/ctl_0_ --ctl=/tmp/500/ctl_1_ --ctl=/tmp/500/ctl_2_ --ctl=/tmp/500/ctl_3_ --ctl=/tmp/500/ctl_4_ --ctl=/tmp/500/ctl_5_ --ctl=/tmp/500/ctl_6_ --ctl=/tmp/500/ctl_7_ --mu-par --mu-opt
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-05
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-07
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-08
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-10
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-11
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-14

BK_STOP 1679664627162

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-01
ctl formula formula --ctl=/tmp/500/ctl_0_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-05
ctl formula formula --ctl=/tmp/500/ctl_1_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-06
ctl formula formula --ctl=/tmp/500/ctl_2_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-07
ctl formula formula --ctl=/tmp/500/ctl_3_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-08
ctl formula formula --ctl=/tmp/500/ctl_4_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-10
ctl formula formula --ctl=/tmp/500/ctl_5_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-11
ctl formula formula --ctl=/tmp/500/ctl_6_
ctl formula name MultiCrashLeafsetExtension-PT-S32C05-CTLCardinality-14
ctl formula formula --ctl=/tmp/500/ctl_7_
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 20453 places, 31713 transitions and 126457 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.680 real 0.380 user 0.300 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: 31713->31713 groups
pnml2lts-sym: Regrouping took 854.170 real 852.080 user 1.710 sys
pnml2lts-sym: state vector length is 20453; there are 31713 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
MDD Unique table full, 268435456 of 268435456 buckets filled!

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="MultiCrashLeafsetExtension-PT-S32C05"
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 MultiCrashLeafsetExtension-PT-S32C05, 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-167856419600913"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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