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

About the Execution of Smart+red for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15061.271 210406.00 269227.00 192.90 FFFFTF?F??F?F??F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696600263.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696600263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 18K Feb 25 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 579K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 398K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678780554359

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 07:55:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 07:55:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:55:56] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2023-03-14 07:55:56] [INFO ] Transformed 138 places.
[2023-03-14 07:55:56] [INFO ] Transformed 2348 transitions.
[2023-03-14 07:55:56] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 15) seen :3
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 3730 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 3004 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-14 07:56:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-14 07:56:08] [INFO ] Computed 7 place invariants in 25 ms
[2023-03-14 07:56:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-14 07:56:16] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-14 07:56:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-14 07:56:25] [INFO ] After 8913ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-14 07:56:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:56:34] [INFO ] After 8365ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2023-03-14 07:56:41] [INFO ] After 15404ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-14 07:56:41] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 387 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-14 07:56:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-14 07:56:41] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-14 07:56:42] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1302 ms. Remains : 136/138 places, 2348/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 3434 ms. (steps per millisecond=2 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 993812 steps, run timeout after 12001 ms. (steps per millisecond=82 ) properties seen :{6=1}
Probabilistic random walk after 993812 steps, saw 263796 distinct states, run finished after 12004 ms. (steps per millisecond=82 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-14 07:56:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-14 07:56:59] [INFO ] Invariant cache hit.
[2023-03-14 07:57:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:57:01] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 07:57:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:57:11] [INFO ] After 9710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 07:57:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:57:19] [INFO ] After 8682ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-14 07:57:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 07:57:28] [INFO ] After 27182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 135 ms.
Support contains 135 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 204 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 136/136 places, 2348/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 3080 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 768677 steps, run timeout after 9001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 768677 steps, saw 203929 distinct states, run finished after 9003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-14 07:57:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-14 07:57:41] [INFO ] Invariant cache hit.
[2023-03-14 07:57:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:57:44] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 07:57:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:57:57] [INFO ] After 12702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 07:57:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:58:06] [INFO ] After 8773ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-14 07:58:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 07:58:11] [INFO ] After 27038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 71 ms.
Support contains 135 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 204 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 206 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-14 07:58:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-14 07:58:12] [INFO ] Invariant cache hit.
[2023-03-14 07:58:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-14 07:58:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-14 07:58:12] [INFO ] Invariant cache hit.
[2023-03-14 07:58:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 07:58:12] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-14 07:58:12] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-14 07:58:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-14 07:58:12] [INFO ] Invariant cache hit.
[2023-03-14 07:58:13] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451 ms. Remains : 136/136 places, 2348/2348 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 136 transition count 290
Applied a total of 2058 rules in 8 ms. Remains 136 /136 variables (removed 0) and now considering 290/2348 (removed 2058) transitions.
Running SMT prover for 6 properties.
[2023-03-14 07:58:13] [INFO ] Invariant cache hit.
[2023-03-14 07:58:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:58:15] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 07:58:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:58:24] [INFO ] After 9033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 07:58:33] [INFO ] After 17562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8579 ms.
[2023-03-14 07:58:42] [INFO ] After 26477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-14 07:58:42] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 54 ms.
[2023-03-14 07:58:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 2348 transitions and 18088 arcs took 25 ms.
[2023-03-14 07:58:42] [INFO ] Flatten gal took : 243 ms
Total runtime 166238 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BridgeAndVehicles (PT), instance V50P50N20
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 136 places, 2348 transitions, 18088 arcs.
Final Score: 11963.202
Took : 41 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678780764765

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 20585:
syntax error

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="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V50P50N20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696600263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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