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

About the Execution of LTSMin+red for GPPP-PT-C0100N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
523.252 152210.00 203348.00 776.00 TTFTFTFTTTTFFFFT 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.r169-tall-167838856500846.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 GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678650648359

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:50:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:50:50] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 19:50:50] [INFO ] Transformed 33 places.
[2023-03-12 19:50:50] [INFO ] Transformed 22 transitions.
[2023-03-12 19:50:50] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 23 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 16) seen :2
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:50:51] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 19:50:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 19:50:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 19:50:51] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-12 19:50:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 19:50:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 43 ms returned sat
[2023-03-12 19:51:16] [INFO ] After 15531ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-12 19:51:16] [INFO ] After 15535ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 19:51:16] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:51:16] [INFO ] Invariant cache hit.
[2023-03-12 19:51:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 33/33 places, 22/22 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 909621 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 909621 steps, saw 150740 distinct states, run finished after 3002 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 19:51:20] [INFO ] Invariant cache hit.
[2023-03-12 19:51:20] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 19:51:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 19:51:20] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 19:51:45] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:51:45] [INFO ] Invariant cache hit.
[2023-03-12 19:51:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 19:51:45] [INFO ] Invariant cache hit.
[2023-03-12 19:51:45] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 88 ms. Remains : 32/33 places, 22/22 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 889416 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 889416 steps, saw 147853 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:51:48] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 19:51:48] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 19:51:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:51:48] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 263 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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.Application.startNoEx(Application.java:902)
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-12 19:52:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:52:13] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 32/32 places, 22/22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:52:13] [INFO ] Invariant cache hit.
[2023-03-12 19:52:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 19:52:13] [INFO ] Invariant cache hit.
[2023-03-12 19:52:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-12 19:52:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:52:13] [INFO ] Invariant cache hit.
[2023-03-12 19:52:13] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-12 19:52:13] [INFO ] Invariant cache hit.
[2023-03-12 19:52:13] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 19:52:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:52:13] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 19:52:43] [INFO ] After 29812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:53:05] [INFO ] After 51396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1472 ms.
[2023-03-12 19:53:06] [INFO ] After 52974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:53:06] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 19:53:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 22 transitions and 81 arcs took 1 ms.
[2023-03-12 19:53:06] [INFO ] Flatten gal took : 29 ms
Total runtime 137117 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 --invariant=/tmp/508/inv_0_ --invariant=/tmp/508/inv_1_ --invariant=/tmp/508/inv_2_ --invariant=/tmp/508/inv_3_ --invariant=/tmp/508/inv_4_ --inv-par
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678650800569

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name GPPP-PT-C0100N0000000010-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/508/inv_0_
rfs formula name GPPP-PT-C0100N0000000010-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/508/inv_1_
rfs formula name GPPP-PT-C0100N0000000010-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/508/inv_2_
rfs formula name GPPP-PT-C0100N0000000010-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/508/inv_3_
rfs formula name GPPP-PT-C0100N0000000010-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/508/inv_4_
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 32 places, 22 transitions and 81 arcs
pnml2lts-sym: Petri net GPPP_PT_C0100N0000000010 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 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: 22->19 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 32; there are 19 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: 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: Exploration took 828796 group checks and 0 next state calls
pnml2lts-sym: reachability took 12.230 real 47.960 user 0.880 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.160 real 0.650 user 0.000 sys
pnml2lts-sym: state space has 14184612091 states, 628291 nodes
pnml2lts-sym: group_next: 10389 nodes total
pnml2lts-sym: group_explored: 11394 nodes, 480571 short vectors total
pnml2lts-sym: max token count: 740

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="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="ReachabilityCardinality"
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 GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856500846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;