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

About the Execution of Smart+red for DoubleExponent-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2270.411 3600000.00 3654088.00 9261.60 [undef] Time out reached

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.r139-smll-167819423200494.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 smartxred
Input is DoubleExponent-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819423200494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 DoubleExponent-PT-100-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678435520632

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 08:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 08:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:05:24] [INFO ] Load time of PNML (sax parser for PT used): 509 ms
[2023-03-10 08:05:24] [INFO ] Transformed 5304 places.
[2023-03-10 08:05:24] [INFO ] Transformed 4998 transitions.
[2023-03-10 08:05:24] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 696 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 327 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 37162 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37162 steps, saw 18591 distinct states, run finished after 3019 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 4998 rows 5304 cols
[2023-03-10 08:05:31] [INFO ] Invariants computation overflowed in 483 ms
[2023-03-10 08:05:35] [INFO ] After 3910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-10 08:06:00] [INFO ] After 20067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-10 08:06:00] [INFO ] After 20087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 08:06:00] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 153 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.29 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1057 transitions
Trivial Post-agglo rules discarded 1057 transitions
Performed 1057 trivial Post agglomeration. Transition count delta: 1057
Iterating post reduction 0 with 1060 rules applied. Total rules applied 1061 place count 5297 transition count 3939
Reduce places removed 1057 places and 0 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Iterating post reduction 1 with 1109 rules applied. Total rules applied 2170 place count 4240 transition count 3887
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 2222 place count 4188 transition count 3887
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2222 place count 4188 transition count 3687
Deduced a syphon composed of 200 places in 282 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2622 place count 3988 transition count 3687
Performed 832 Post agglomeration using F-continuation condition.Transition count delta: 832
Deduced a syphon composed of 832 places in 180 ms
Reduce places removed 832 places and 0 transitions.
Iterating global reduction 3 with 1664 rules applied. Total rules applied 4286 place count 3156 transition count 2855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 105 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4488 place count 3055 transition count 2855
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 181 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 4632 place count 2983 transition count 2855
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4635 place count 2983 transition count 2852
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4638 place count 2980 transition count 2852
Free-agglomeration rule (complex) applied 410 times.
Iterating global reduction 4 with 410 rules applied. Total rules applied 5048 place count 2980 transition count 2442
Reduce places removed 410 places and 0 transitions.
Iterating post reduction 4 with 410 rules applied. Total rules applied 5458 place count 2570 transition count 2442
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 5858 place count 2570 transition count 2442
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 5860 place count 2570 transition count 2442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5861 place count 2569 transition count 2441
Applied a total of 5861 rules in 3946 ms. Remains 2569 /5304 variables (removed 2735) and now considering 2441/4998 (removed 2557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3948 ms. Remains : 2569/5304 places, 2441/4998 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 51948 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51948 steps, saw 25992 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 2441 rows 2569 cols
[2023-03-10 08:06:08] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-10 08:06:09] [INFO ] After 1449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-10 08:06:34] [INFO ] After 22461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-10 08:06:34] [INFO ] State equation strengthened by 358 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.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-10 08:06:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 08:06:34] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 153 out of 2569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2569/2569 places, 2441/2441 transitions.
Applied a total of 0 rules in 193 ms. Remains 2569 /2569 variables (removed 0) and now considering 2441/2441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2569/2569 places, 2441/2441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2569/2569 places, 2441/2441 transitions.
Applied a total of 0 rules in 187 ms. Remains 2569 /2569 variables (removed 0) and now considering 2441/2441 (removed 0) transitions.
// Phase 1: matrix 2441 rows 2569 cols
[2023-03-10 08:06:35] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-10 08:06:39] [INFO ] Implicit Places using invariants in 4442 ms returned []
// Phase 1: matrix 2441 rows 2569 cols
[2023-03-10 08:06:39] [INFO ] Invariants computation overflowed in 159 ms
[2023-03-10 08:06:44] [INFO ] Implicit Places using invariants and state equation in 4956 ms returned []
Implicit Place search using SMT with State Equation took 9409 ms to find 0 implicit places.
[2023-03-10 08:06:45] [INFO ] Redundant transitions in 545 ms returned []
// Phase 1: matrix 2441 rows 2569 cols
[2023-03-10 08:06:45] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-10 08:06:48] [INFO ] Dead Transitions using invariants and state equation in 2894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13057 ms. Remains : 2569/2569 places, 2441/2441 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 2569 transition count 2427
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 2555 transition count 2427
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 165 Pre rules applied. Total rules applied 28 place count 2555 transition count 2262
Deduced a syphon composed of 165 places in 67 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 358 place count 2390 transition count 2262
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 361 place count 2390 transition count 2259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 364 place count 2387 transition count 2259
Applied a total of 364 rules in 657 ms. Remains 2387 /2569 variables (removed 182) and now considering 2259/2441 (removed 182) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 2259 rows 2387 cols
[2023-03-10 08:06:48] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-10 08:06:50] [INFO ] After 1345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-10 08:10:35] [INFO ] After 222900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-10 08:10:35] [INFO ] State equation strengthened by 2 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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-10 08:10:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 08:10:35] [INFO ] After 225039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
[2023-03-10 08:10:35] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-10 08:10:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2569 places, 2441 transitions and 17259 arcs took 40 ms.
[2023-03-10 08:10:36] [INFO ] Flatten gal took : 609 ms
Total runtime 312657 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 100
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2569 places, 2441 transitions, 17259 arcs.
Final Score: 366823.613
Took : 62 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (tk(P161)) <= ( 0 ) ) | ( (tk(P1702)) <= ( 1 ) ) ) | ( (! ( ( 1 ) <= (tk(P1960)) )) | ( ( (tk(P159)) <= ( 0 ) ) & ( (! ( (tk(P2216)) <= (tk(P785)) )) | ( ( (tk(P1362)) <= (tk(P546)) ) & (! ( (tk(P323)) <= (tk(P2298)) )) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-01 (reachable & potential(( (! ( (tk(P995)) <= (tk(P368)) )) | ( (! ( (tk(P428)) <= (tk(P2046)) )) | ( ( ( (tk(P113)) <= ( 0 ) ) & ( (tk(P2368)) <= (tk(P1044)) ) ) & ( (! ( (tk(P2287)) <= (tk(P456)) )) & ( ( ( 1 ) <= (tk(P622)) ) & ( ( (tk(P2149)) <= (tk(P15)) ) | ( ( ( 1 ) <= (tk(P1806)) ) | ( ( ( 1 ) <= (tk(P1084)) ) & ( ( 1 ) <= (tk(P1039)) ) ) ) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-02 (reachable & potential((! ( (tk(P1364)) <= ( 0 ) ))))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P717)) <= ( 0 ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-04 (reachable & potential(( ( ( 1 ) <= (tk(P1035)) ) & ( ( (tk(P2488)) <= ( 1 ) ) | ( ( ( (! ( (tk(P2182)) <= (tk(P332)) )) & ( ( 1 ) <= (tk(P461)) ) ) & ( (! ( (tk(P2007)) <= (tk(P2533)) )) & ( (! ( (tk(P2329)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P992)) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P2412)) )) & ( (tk(P895)) <= (tk(P2038)) ) ) & ( ( ( 1 ) <= (tk(P2065)) ) & ( ( ( (tk(P585)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P916)) ) & ( (tk(P2291)) <= (tk(P674)) ) ) ) & ( ( (tk(P1413)) <= (tk(P366)) ) | ( ( 1 ) <= (tk(P1130)) ) ) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-05 (reachable &!potential( ( ( (tk(P548)) <= ( 0 ) ) | ( ( (tk(P814)) <= (tk(P1672)) ) & (! ( (tk(P256)) <= ( 1 ) )) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P2364)) <= (tk(P632)) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P2361)) <= ( 1 ) ) | ( ( (tk(P2228)) <= (tk(P1927)) ) & ( (! ( ( 1 ) <= (tk(P2267)) )) & ( (tk(P1100)) <= ( 1 ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-08 (reachable & potential(( ( ( (tk(P1267)) <= (tk(P1725)) ) & ( ( (tk(P1736)) <= ( 0 ) ) & ( (! ( ( 1 ) <= (tk(P1563)) )) | ( (tk(P2170)) <= ( 0 ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P2364)) )) | ( ( (tk(P2147)) <= (tk(P1529)) ) & ( ( ( 1 ) <= (tk(P143)) ) & ( ( (tk(P258)) <= (tk(P1695)) ) | ( ( 1 ) <= (tk(P2192)) ) ) ) ) ) & ( ( ( (tk(P1556)) <= (tk(P805)) ) | ( (! ( ( 1 ) <= (tk(P624)) )) & (! ( ( 1 ) <= (tk(P698)) )) ) ) & ( (! ( (tk(P1457)) <= (tk(P2270)) )) | ( ( ( 1 ) <= (tk(P1627)) ) & ( ( ( 1 ) <= (tk(P2104)) ) & (! ( ( 1 ) <= (tk(P142)) )) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-09 (reachable &!potential( ( (tk(P1456)) <= ( 1 ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P363)) <= ( 0 ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-11 (reachable & potential(( ( ( ( 1 ) <= (tk(P1863)) ) & ( (! ( ( 1 ) <= (tk(P400)) )) & ( ( 1 ) <= (tk(P1479)) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P1145)) ) | ( (! ( (tk(P2438)) <= (tk(P215)) )) | (! ( (tk(P80)) <= ( 0 ) )) ) ) | ( ( (tk(P1753)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P57)) ) | (! ( (tk(P1512)) <= ( 1 ) )) ) ) ) & ( ( ( (! ( (tk(P1093)) <= (tk(P915)) )) | (! ( ( 1 ) <= (tk(P2507)) )) ) | ( ( ( (tk(P487)) <= ( 1 ) ) & ( (tk(P2235)) <= ( 1 ) ) ) | ( ( ( (tk(P1477)) <= (tk(P20)) ) & ( (tk(P2424)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P2154)) ) & ( ( (tk(P1005)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1595)) ) ) ) ) ) ) & ( (! ( (tk(P2164)) <= (tk(P299)) )) | ( ( (tk(P1483)) <= (tk(P1559)) ) & ( ( 1 ) <= (tk(P2453)) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P1224)) <= (tk(P1920)) ) | ( ( (! ( (tk(P2108)) <= ( 0 ) )) & ( ( ( (tk(P560)) <= ( 0 ) ) | ( (! ( (tk(P2107)) <= (tk(P2330)) )) | ( ( (tk(P1240)) <= ( 0 ) ) & ( ( (tk(P119)) <= ( 1 ) ) | ( (tk(P2358)) <= (tk(P1864)) ) ) ) ) ) & ( ( ( (tk(P2340)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P807)) )) ) | ( (! ( (tk(P1382)) <= (tk(P399)) )) | ( ( ( 1 ) <= (tk(P761)) ) & ( ( 1 ) <= (tk(P627)) ) ) ) ) ) ) | ( (! ( (tk(P2238)) <= (tk(P2260)) )) & ( ( (tk(P442)) <= ( 1 ) ) & ( ( (tk(P223)) <= (tk(P109)) ) | ( ( 1 ) <= (tk(P1704)) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P481)) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-14 (reachable & potential(( ( (! ( (tk(P2005)) <= ( 0 ) )) & (! ( (tk(P1018)) <= ( 0 ) )) ) & ( (! ( (tk(P2303)) <= (tk(P954)) )) & ( ( (! ( (tk(P1701)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P1279)) ) ) | ( ( (tk(P1907)) <= ( 1 ) ) | ( (! ( ( 1 ) <= (tk(P1544)) )) | ( (tk(P600)) <= ( 1 ) ) ) ) ) ) )))
PROPERTY: DoubleExponent-PT-100-ReachabilityCardinality-15 (reachable & potential(( ( ( 1 ) <= (tk(P2069)) ) & ( (! ( (tk(P1998)) <= ( 0 ) )) | ( ( (tk(P1135)) <= (tk(P226)) ) & ( ( (tk(P1087)) <= ( 0 ) ) | ( ( (tk(P904)) <= (tk(P1733)) ) | ( (! ( (tk(P431)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P1477)) ) & ( ( ( ( 1 ) <= (tk(P733)) ) & ( ( ( 1 ) <= (tk(P750)) ) & ( ( (tk(P135)) <= ( 0 ) ) | ( (tk(P1182)) <= ( 0 ) ) ) ) ) | ( ( ( 1 ) <= (tk(P1536)) ) & ( ( ( 1 ) <= (tk(P141)) ) & ( (tk(P1467)) <= ( 1 ) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13878120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100132 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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="DoubleExponent-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DoubleExponent-PT-100, 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 r139-smll-167819423200494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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