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

About the Execution of Smart+red for Peterson-COL-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3859.212 128268.00 172366.00 619.80 FTFTT??F?FTFTFFF 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.r267-smll-167863542000575.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 Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542000575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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 Peterson-COL-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678930049281

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=Peterson-COL-4
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 01:27:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 01:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:27:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 01:27:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 01:27:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 840 ms
[2023-03-16 01:27:33] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 01:27:33] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2023-03-16 01:27:33] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 217 steps, including 0 resets, run visited all 7 properties in 44 ms. (steps per millisecond=4 )
[2023-03-16 01:27:33] [INFO ] Flatten gal took : 18 ms
[2023-03-16 01:27:33] [INFO ] Flatten gal took : 4 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 01:27:33] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 67 ms.
[2023-03-16 01:27:33] [INFO ] Unfolded 15 HLPN properties in 16 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 20 places in 9 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 12) seen :9
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:27:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 01:27:36] [INFO ] Computed 19 place invariants in 27 ms
[2023-03-16 01:27:39] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-16 01:27:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-16 01:27:39] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:27:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-16 01:27:39] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 20 ms returned sat
[2023-03-16 01:27:49] [INFO ] After 9987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:27:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 01:27:58] [INFO ] After 8352ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:28:00] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 26 ms to minimize.
[2023-03-16 01:28:00] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 3 ms to minimize.
[2023-03-16 01:28:00] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 2 ms to minimize.
[2023-03-16 01:28:01] [INFO ] Deduced a trap composed of 10 places in 431 ms of which 4 ms to minimize.
[2023-03-16 01:28:01] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 1 ms to minimize.
[2023-03-16 01:28:02] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 1 ms to minimize.
[2023-03-16 01:28:02] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 1 ms to minimize.
[2023-03-16 01:28:03] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 2 ms to minimize.
[2023-03-16 01:28:03] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 1 ms to minimize.
[2023-03-16 01:28:03] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 1 ms to minimize.
[2023-03-16 01:28:04] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2023-03-16 01:28:04] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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-16 01:28:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:28:04] [INFO ] After 25207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 82 ms.
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 35 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 480/480 places, 690/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1296 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 525834 steps, run timeout after 6001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 525834 steps, saw 107116 distinct states, run finished after 6009 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:28:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 01:28:13] [INFO ] Invariant cache hit.
[2023-03-16 01:28:15] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-16 01:28:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 14 ms returned sat
[2023-03-16 01:28:15] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:28:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-16 01:28:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-16 01:28:24] [INFO ] After 9020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:28:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 01:28:32] [INFO ] After 7595ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:28:33] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2023-03-16 01:28:33] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 1 ms to minimize.
[2023-03-16 01:28:34] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
[2023-03-16 01:28:34] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2023-03-16 01:28:34] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2023-03-16 01:28:35] [INFO ] Deduced a trap composed of 98 places in 307 ms of which 1 ms to minimize.
[2023-03-16 01:28:35] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 1 ms to minimize.
[2023-03-16 01:28:35] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 1 ms to minimize.
[2023-03-16 01:28:36] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 1 ms to minimize.
[2023-03-16 01:28:36] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 1 ms to minimize.
[2023-03-16 01:28:36] [INFO ] Deduced a trap composed of 94 places in 252 ms of which 1 ms to minimize.
[2023-03-16 01:28:36] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 1 ms to minimize.
[2023-03-16 01:28:37] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 1 ms to minimize.
[2023-03-16 01:28:37] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 1 ms to minimize.
[2023-03-16 01:28:38] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 1 ms to minimize.
[2023-03-16 01:28:38] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 1 ms to minimize.
[2023-03-16 01:28:38] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 1 ms to minimize.
[2023-03-16 01:28:38] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 1 ms to minimize.
[2023-03-16 01:28:39] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2023-03-16 01:28:39] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 2 ms to minimize.
[2023-03-16 01:28:40] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 1 ms to minimize.
[2023-03-16 01:28:40] [INFO ] Deduced a trap composed of 2 places in 333 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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-16 01:28:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:28:40] [INFO ] After 25349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 33 ms.
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 01:28:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 01:28:40] [INFO ] Invariant cache hit.
[2023-03-16 01:28:40] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-16 01:28:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 01:28:40] [INFO ] Invariant cache hit.
[2023-03-16 01:28:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 01:28:41] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-16 01:28:41] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-16 01:28:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 01:28:41] [INFO ] Invariant cache hit.
[2023-03-16 01:28:41] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1482 ms. Remains : 480/480 places, 690/690 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 480 transition count 630
Applied a total of 60 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 01:28:42] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-16 01:28:43] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-16 01:28:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2023-03-16 01:28:43] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:28:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-16 01:28:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2023-03-16 01:28:52] [INFO ] After 8896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:29:01] [INFO ] After 17705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7995 ms.
[2023-03-16 01:29:09] [INFO ] After 26122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:29:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 23 ms.
[2023-03-16 01:29:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 5 ms.
[2023-03-16 01:29:09] [INFO ] Flatten gal took : 122 ms
Total runtime 97171 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Peterson (COL), instance 4
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: 480 places, 690 transitions, 2120 arcs.
Final Score: 26696.186
Took : 26 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678930177549

--------------------
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 3310:
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="Peterson-COL-4"
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 Peterson-COL-4, 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 r267-smll-167863542000575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;