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-167813697200679.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 CANConstruction-PT-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 9.5M 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 CANConstruction-PT-080-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678799496955

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=CANConstruction-PT-080
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:11:39] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2023-03-14 13:11:39] [INFO ] Transformed 13762 places.
[2023-03-14 13:11:39] [INFO ] Transformed 26240 transitions.
[2023-03-14 13:11:39] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-14 13:11:41] [INFO ] Computed 161 place invariants in 403 ms
[2023-03-14 13:11:45] [INFO ] [Real]Absence check using 81 positive place invariants in 357 ms returned sat
[2023-03-14 13:11:46] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 118 ms returned sat
[2023-03-14 13:11:46] [INFO ] After 5084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 13:11:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 317 ms returned sat
[2023-03-14 13:11:50] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 171 ms returned sat
[2023-03-14 13:12:11] [INFO ] After 17422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 13:12:11] [INFO ] State equation strengthened by 12720 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-14 13:12:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:12:11] [INFO ] After 25304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 269 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 455 transitions
Trivial Post-agglo rules discarded 455 transitions
Performed 455 trivial Post agglomeration. Transition count delta: 455
Iterating post reduction 0 with 455 rules applied. Total rules applied 455 place count 13762 transition count 25785
Reduce places removed 455 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 458 rules applied. Total rules applied 913 place count 13307 transition count 25782
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 916 place count 13304 transition count 25782
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 916 place count 13304 transition count 25745
Deduced a syphon composed of 37 places in 9 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 990 place count 13267 transition count 25745
Discarding 6137 places :
Symmetric choice reduction at 3 with 6137 rule applications. Total rules 7127 place count 7130 transition count 13471
Iterating global reduction 3 with 6137 rules applied. Total rules applied 13264 place count 7130 transition count 13471
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 13348 place count 7088 transition count 13429
Free-agglomeration rule applied 44 times.
Iterating global reduction 3 with 44 rules applied. Total rules applied 13392 place count 7088 transition count 13385
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 13436 place count 7044 transition count 13385
Free-agglomeration rule (complex) applied 59 times.
Iterating global reduction 4 with 59 rules applied. Total rules applied 13495 place count 7044 transition count 13326
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 13554 place count 6985 transition count 13326
Partial Free-agglomeration rule applied 153 times.
Drop transitions removed 153 transitions
Iterating global reduction 5 with 153 rules applied. Total rules applied 13707 place count 6985 transition count 13326
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 13734 place count 6985 transition count 13326
Applied a total of 13734 rules in 11857 ms. Remains 6985 /13762 variables (removed 6777) and now considering 13326/26240 (removed 12914) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11860 ms. Remains : 6985/13762 places, 13326/26240 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 13) seen :4
FORMULA CANConstruction-PT-080-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 13326 rows 6985 cols
[2023-03-14 13:12:24] [INFO ] Computed 161 place invariants in 166 ms
[2023-03-14 13:12:26] [INFO ] [Real]Absence check using 81 positive place invariants in 220 ms returned sat
[2023-03-14 13:12:26] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 128 ms returned sat
[2023-03-14 13:12:27] [INFO ] After 2535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 13:12:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 210 ms returned sat
[2023-03-14 13:12:29] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 100 ms returned sat
[2023-03-14 13:12:40] [INFO ] After 10297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 13:12:41] [INFO ] State equation strengthened by 12852 read => feed constraints.
[2023-03-14 13:12:51] [INFO ] After 10868ms SMT Verify possible using 12852 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 13:12:52] [INFO ] After 11069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-14 13:12:52] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 249 ms.
Support contains 206 out of 6985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6985/6985 places, 13326/13326 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6983 transition count 13322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6983 transition count 13322
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 74 place count 6948 transition count 13287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 6946 transition count 13287
Applied a total of 78 rules in 6318 ms. Remains 6946 /6985 variables (removed 39) and now considering 13287/13326 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6318 ms. Remains : 6946/6985 places, 13287/13326 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 9) seen :2
FORMULA CANConstruction-PT-080-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 13287 rows 6946 cols
[2023-03-14 13:12:59] [INFO ] Computed 161 place invariants in 122 ms
[2023-03-14 13:13:01] [INFO ] [Real]Absence check using 81 positive place invariants in 166 ms returned sat
[2023-03-14 13:13:01] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 93 ms returned sat
[2023-03-14 13:13:01] [INFO ] After 2078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 13:13:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 157 ms returned sat
[2023-03-14 13:13:03] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 117 ms returned sat
[2023-03-14 13:13:13] [INFO ] After 9299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 13:13:14] [INFO ] State equation strengthened by 12885 read => feed constraints.
[2023-03-14 13:13:25] [INFO ] After 11860ms SMT Verify possible using 12885 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-14 13:13:27] [INFO ] After 12921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-14 13:13:27] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 81 ms.
Support contains 203 out of 6946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6946/6946 places, 13287/13287 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6945 transition count 13286
Applied a total of 2 rules in 3555 ms. Remains 6945 /6946 variables (removed 1) and now considering 13286/13287 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3555 ms. Remains : 6945/6946 places, 13286/13287 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 64865 steps, run timeout after 3002 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64865 steps, saw 56634 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 13286 rows 6945 cols
[2023-03-14 13:13:34] [INFO ] Computed 161 place invariants in 128 ms
[2023-03-14 13:13:36] [INFO ] [Real]Absence check using 81 positive place invariants in 191 ms returned sat
[2023-03-14 13:13:36] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 89 ms returned sat
[2023-03-14 13:13:36] [INFO ] After 2092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 13:13:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 204 ms returned sat
[2023-03-14 13:13:38] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 97 ms returned sat
[2023-03-14 13:13:48] [INFO ] After 9038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 13:13:48] [INFO ] State equation strengthened by 12886 read => feed constraints.
[2023-03-14 13:14:01] [INFO ] After 13126ms SMT Verify possible using 12886 Read/Feed constraints in natural domain returned unsat :0 sat :7
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.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 13:14:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:14:01] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA CANConstruction-PT-080-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 152 ms.
Support contains 111 out of 6945 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6945/6945 places, 13286/13286 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6945 transition count 13284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6943 transition count 13284
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 6933 transition count 13264
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 6933 transition count 13264
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 5 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 92 place count 6899 transition count 13230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 6893 transition count 13234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 6893 transition count 13233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 6892 transition count 13233
Applied a total of 106 rules in 8477 ms. Remains 6892 /6945 variables (removed 53) and now considering 13233/13286 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8478 ms. Remains : 6892/6945 places, 13233/13286 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 78724 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78724 steps, saw 68573 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 13233 rows 6892 cols
[2023-03-14 13:14:13] [INFO ] Computed 161 place invariants in 123 ms
[2023-03-14 13:14:15] [INFO ] [Real]Absence check using 81 positive place invariants in 167 ms returned sat
[2023-03-14 13:14:15] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 133 ms returned sat
[2023-03-14 13:14:16] [INFO ] After 2097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:14:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 205 ms returned sat
[2023-03-14 13:14:17] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 91 ms returned sat
[2023-03-14 13:14:26] [INFO ] After 8575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:14:27] [INFO ] State equation strengthened by 12920 read => feed constraints.
[2023-03-14 13:14:34] [INFO ] After 7784ms SMT Verify possible using 12920 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:14:39] [INFO ] After 12226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1870 ms.
[2023-03-14 13:14:41] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 96 ms.
Support contains 111 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 13233/13233 transitions.
Applied a total of 0 rules in 1868 ms. Remains 6892 /6892 variables (removed 0) and now considering 13233/13233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1869 ms. Remains : 6892/6892 places, 13233/13233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 13233/13233 transitions.
Applied a total of 0 rules in 1787 ms. Remains 6892 /6892 variables (removed 0) and now considering 13233/13233 (removed 0) transitions.
[2023-03-14 13:14:44] [INFO ] Invariant cache hit.
[2023-03-14 13:14:49] [INFO ] Implicit Places using invariants in 4886 ms returned []
Implicit Place search using SMT only with invariants took 4892 ms to find 0 implicit places.
[2023-03-14 13:14:49] [INFO ] Invariant cache hit.
[2023-03-14 13:14:57] [INFO ] Dead Transitions using invariants and state equation in 7933 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14616 ms. Remains : 6892/6892 places, 13233/13233 transitions.
Graph (trivial) has 11644 edges and 6892 vertex of which 5169 / 6892 are part of one of the 64 SCC in 12 ms
Free SCC test removed 5105 places
Drop transitions removed 10111 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 10131 transitions.
Graph (complete) has 3644 edges and 1787 vertex of which 1612 are kept as prefixes of interest. Removing 175 places using SCC suffix rule.3 ms
Discarding 175 places :
Also discarding 91 output transitions
Drop transitions removed 91 transitions
Ensure Unique test removed 6 places
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 1606 transition count 2762
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Performed 1103 Post agglomeration using F-continuation condition.Transition count delta: 1103
Iterating post reduction 1 with 1412 rules applied. Total rules applied 1669 place count 1450 transition count 1506
Reduce places removed 1103 places and 0 transitions.
Ensure Unique test removed 1074 transitions
Reduce isomorphic transitions removed 1074 transitions.
Iterating post reduction 2 with 2177 rules applied. Total rules applied 3846 place count 347 transition count 432
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 3846 place count 347 transition count 416
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3878 place count 331 transition count 416
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 3896 place count 313 transition count 398
Iterating global reduction 3 with 18 rules applied. Total rules applied 3914 place count 313 transition count 398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3921 place count 313 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3921 place count 313 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3923 place count 312 transition count 390
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3929 place count 309 transition count 387
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3937 place count 305 transition count 388
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3951 place count 305 transition count 374
Free-agglomeration rule applied 46 times.
Iterating global reduction 4 with 46 rules applied. Total rules applied 3997 place count 305 transition count 328
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 4062 place count 253 transition count 315
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 4068 place count 253 transition count 309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4074 place count 247 transition count 309
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 4086 place count 247 transition count 309
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 4094 place count 239 transition count 301
Iterating global reduction 6 with 8 rules applied. Total rules applied 4102 place count 239 transition count 301
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4106 place count 235 transition count 297
Applied a total of 4106 rules in 450 ms. Remains 235 /6892 variables (removed 6657) and now considering 297/13233 (removed 12936) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 297 rows 235 cols
[2023-03-14 13:14:58] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-14 13:14:58] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2023-03-14 13:14:58] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:14:58] [INFO ] [Nat]Absence check using 63 positive place invariants in 9 ms returned sat
[2023-03-14 13:14:58] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:14:58] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-14 13:14:58] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:14:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-14 13:14:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6892 places, 13233 transitions and 52827 arcs took 53 ms.
[2023-03-14 13:14:59] [INFO ] Flatten gal took : 600 ms
Total runtime 200955 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 080
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: 6892 places, 13233 transitions, 52827 arcs.
Final Score: 2.9602295805E7
Took : 161 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678799862547

--------------------
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 73039:
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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-167813697200679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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