About the Execution of ITS-Tools for LeafsetExtension-PT-S64C2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1569.567 | 46574.00 | 109562.00 | 1098.90 | TTTFTTFFFTTFFTTF | 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.r229-tall-167856413400526.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 itstools
Input is LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413400526
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679500898250
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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-22 16:01:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 16:01:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:01:40] [INFO ] Load time of PNML (sax parser for PT used): 456 ms
[2023-03-22 16:01:40] [INFO ] Transformed 21462 places.
[2023-03-22 16:01:40] [INFO ] Transformed 21129 transitions.
[2023-03-22 16:01:40] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 547 resets, run finished after 883 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 16:01:42] [INFO ] Flatten gal took : 1271 ms
[2023-03-22 16:01:43] [INFO ] Flatten gal took : 614 ms
[2023-03-22 16:01:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16391991338749837898.gal : 193 ms
[2023-03-22 16:01:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8985441954247869177.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16391991338749837898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8985441954247869177.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-22 16:01:45] [INFO ] Computed 333 place invariants in 2775 ms
Loading property file /tmp/ReachabilityCardinality8985441954247869177.prop.
[2023-03-22 16:01:52] [INFO ] [Real]Absence check using 67 positive place invariants in 337 ms returned sat
[2023-03-22 16:01:52] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 767 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.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-22 16:02:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:02:10] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 101 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 3773 are kept as prefixes of interest. Removing 17689 places using SCC suffix rule.35 ms
Discarding 17689 places :
Also discarding 9276 output transitions
Drop transitions removed 9276 transitions
Drop transitions removed 4129 transitions
Reduce isomorphic transitions removed 4129 transitions.
Drop transitions removed 1601 transitions
Trivial Post-agglo rules discarded 1601 transitions
Performed 1601 trivial Post agglomeration. Transition count delta: 1601
Iterating post reduction 0 with 5730 rules applied. Total rules applied 5731 place count 3773 transition count 6123
Reduce places removed 1603 places and 0 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 1 with 1653 rules applied. Total rules applied 7384 place count 2170 transition count 6073
Reduce places removed 50 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 55 rules applied. Total rules applied 7439 place count 2120 transition count 6068
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 7444 place count 2115 transition count 6068
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 7444 place count 2115 transition count 6001
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 7578 place count 2048 transition count 6001
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 7600 place count 2048 transition count 5979
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 7622 place count 2026 transition count 5979
Partial Free-agglomeration rule applied 1353 times.
Drop transitions removed 1353 transitions
Iterating global reduction 5 with 1353 rules applied. Total rules applied 8975 place count 2026 transition count 5979
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 5 with 33 rules applied. Total rules applied 9008 place count 1993 transition count 5979
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 9030 place count 1993 transition count 5957
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 9052 place count 1971 transition count 5957
Applied a total of 9052 rules in 1910 ms. Remains 1971 /21462 variables (removed 19491) and now considering 5957/21129 (removed 15172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1912 ms. Remains : 1971/21462 places, 5957/21129 transitions.
Incomplete random walk after 10000 steps, including 1824 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 12) seen :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 16:02:13] [INFO ] Flow matrix only has 3517 transitions (discarded 2440 similar events)
// Phase 1: matrix 3517 rows 1971 cols
[2023-03-22 16:02:13] [INFO ] Computed 3 place invariants in 55 ms
[2023-03-22 16:02:13] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 16:02:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 16:02:14] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 16:02:16] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2023-03-22 16:02:16] [INFO ] After 1677ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-22 16:02:16] [INFO ] After 2717ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 10 out of 1971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1971/1971 places, 5957/5957 transitions.
Graph (complete) has 6157 edges and 1971 vertex of which 404 are kept as prefixes of interest. Removing 1567 places using SCC suffix rule.1 ms
Discarding 1567 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 1459 transitions
Reduce isomorphic transitions removed 1459 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 1460 rules applied. Total rules applied 1461 place count 404 transition count 4428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1462 place count 403 transition count 4428
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1463 place count 403 transition count 4428
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 1464 place count 402 transition count 4428
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1465 place count 402 transition count 4427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1466 place count 401 transition count 4427
Applied a total of 1466 rules in 272 ms. Remains 401 /1971 variables (removed 1570) and now considering 4427/5957 (removed 1530) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 401/1971 places, 4427/5957 transitions.
Incomplete random walk after 10000 steps, including 1952 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 36131 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{1=1}
Probabilistic random walk after 36131 steps, saw 13070 distinct states, run finished after 3004 ms. (steps per millisecond=12 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-22 16:02:20] [INFO ] Flow matrix only has 528 transitions (discarded 3899 similar events)
// Phase 1: matrix 528 rows 401 cols
[2023-03-22 16:02:20] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-22 16:02:20] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:02:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 16:02:20] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:02:20] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 16:02:20] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 4427/4427 transitions.
Graph (complete) has 980 edges and 401 vertex of which 297 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.1 ms
Discarding 104 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 297 transition count 4324
Applied a total of 100 rules in 68 ms. Remains 297 /401 variables (removed 104) and now considering 4324/4427 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 297/401 places, 4324/4427 transitions.
Incomplete random walk after 10000 steps, including 1971 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35940 steps, run visited all 1 properties in 2810 ms. (steps per millisecond=12 )
Probabilistic random walk after 35940 steps, saw 13361 distinct states, run finished after 2811 ms. (steps per millisecond=12 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 43774 ms.
BK_STOP 1679500944824
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LeafsetExtension-PT-S64C2, 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 r229-tall-167856413400526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 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 '
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 ;