About the Execution of Smart+red for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1050.151 | 338198.00 | 407617.00 | 85.20 | ?????????????TF? | 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.r395-oct2-167903719100703.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100703
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 ShieldPPPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679579798634
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=ShieldPPPt-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:56:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:56:42] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2023-03-23 13:56:42] [INFO ] Transformed 7803 places.
[2023-03-23 13:56:42] [INFO ] Transformed 7103 transitions.
[2023-03-23 13:56:42] [INFO ] Found NUPN structural information;
[2023-03-23 13:56:42] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 795 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 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 16) seen :2
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-23 13:56:44] [INFO ] Computed 1101 place invariants in 75 ms
[2023-03-23 13:56:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 1539 ms returned sat
[2023-03-23 13:56:50] [INFO ] After 5798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 13:56:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 912 ms returned sat
[2023-03-23 13:57:15] [INFO ] After 18930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-23 13:57:15] [INFO ] After 18939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 13:57:15] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 169 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1784 transitions
Trivial Post-agglo rules discarded 1784 transitions
Performed 1784 trivial Post agglomeration. Transition count delta: 1784
Iterating post reduction 0 with 1784 rules applied. Total rules applied 1784 place count 7803 transition count 5319
Reduce places removed 1784 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1786 rules applied. Total rules applied 3570 place count 6019 transition count 5317
Reduce places removed 1 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 43 rules applied. Total rules applied 3613 place count 6018 transition count 5275
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3655 place count 5976 transition count 5275
Performed 409 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 409 Pre rules applied. Total rules applied 3655 place count 5976 transition count 4866
Deduced a syphon composed of 409 places in 28 ms
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 4 with 818 rules applied. Total rules applied 4473 place count 5567 transition count 4866
Discarding 666 places :
Symmetric choice reduction at 4 with 666 rule applications. Total rules 5139 place count 4901 transition count 4200
Iterating global reduction 4 with 666 rules applied. Total rules applied 5805 place count 4901 transition count 4200
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 261 Pre rules applied. Total rules applied 5805 place count 4901 transition count 3939
Deduced a syphon composed of 261 places in 23 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 4 with 522 rules applied. Total rules applied 6327 place count 4640 transition count 3939
Performed 1648 Post agglomeration using F-continuation condition.Transition count delta: 1648
Deduced a syphon composed of 1648 places in 28 ms
Reduce places removed 1648 places and 0 transitions.
Iterating global reduction 4 with 3296 rules applied. Total rules applied 9623 place count 2992 transition count 2291
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9825 place count 2891 transition count 2291
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10027 place count 2790 transition count 2291
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 7 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 10151 place count 2728 transition count 2291
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 10162 place count 2728 transition count 2280
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 10173 place count 2717 transition count 2280
Partial Free-agglomeration rule applied 284 times.
Drop transitions removed 284 transitions
Iterating global reduction 5 with 284 rules applied. Total rules applied 10457 place count 2717 transition count 2280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10458 place count 2716 transition count 2279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10459 place count 2715 transition count 2279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10459 place count 2715 transition count 2277
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10463 place count 2713 transition count 2277
Applied a total of 10463 rules in 3453 ms. Remains 2713 /7803 variables (removed 5090) and now considering 2277/7103 (removed 4826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3454 ms. Remains : 2713/7803 places, 2277/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 96800 steps, run timeout after 9001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 96800 steps, saw 74141 distinct states, run finished after 9004 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2277 rows 2713 cols
[2023-03-23 13:57:31] [INFO ] Computed 1100 place invariants in 18 ms
[2023-03-23 13:57:33] [INFO ] [Real]Absence check using 1100 positive place invariants in 437 ms returned sat
[2023-03-23 13:57:33] [INFO ] After 1945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 13:57:34] [INFO ] [Nat]Absence check using 1100 positive place invariants in 302 ms returned sat
[2023-03-23 13:57:39] [INFO ] After 3719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 13:57:39] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-23 13:57:43] [INFO ] After 3720ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 13:57:44] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 11 ms to minimize.
[2023-03-23 13:57:44] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 6 ms to minimize.
[2023-03-23 13:57:45] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 2 ms to minimize.
[2023-03-23 13:57:45] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 2 ms to minimize.
[2023-03-23 13:57:46] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 2 ms to minimize.
[2023-03-23 13:57:47] [INFO ] Deduced a trap composed of 3 places in 441 ms of which 1 ms to minimize.
[2023-03-23 13:57:47] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 1 ms to minimize.
[2023-03-23 13:57:48] [INFO ] Deduced a trap composed of 7 places in 455 ms of which 1 ms to minimize.
[2023-03-23 13:57:48] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 1 ms to minimize.
[2023-03-23 13:57:49] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2023-03-23 13:57:49] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 0 ms to minimize.
[2023-03-23 13:57:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6383 ms
[2023-03-23 13:57:50] [INFO ] Deduced a trap composed of 8 places in 564 ms of which 2 ms to minimize.
[2023-03-23 13:57:51] [INFO ] Deduced a trap composed of 6 places in 640 ms of which 3 ms to minimize.
[2023-03-23 13:57:52] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-23 13:57:52] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 1 ms to minimize.
[2023-03-23 13:57:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2471 ms
[2023-03-23 13:57:53] [INFO ] Deduced a trap composed of 9 places in 499 ms of which 1 ms to minimize.
[2023-03-23 13:57:54] [INFO ] Deduced a trap composed of 8 places in 412 ms of which 1 ms to minimize.
[2023-03-23 13:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1376 ms
[2023-03-23 13:57:55] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 1 ms to minimize.
[2023-03-23 13:57:55] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 1 ms to minimize.
[2023-03-23 13:57:56] [INFO ] Deduced a trap composed of 7 places in 684 ms of which 1 ms to minimize.
[2023-03-23 13:57:57] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-23 13:57:57] [INFO ] Deduced a trap composed of 8 places in 537 ms of which 13 ms to minimize.
[2023-03-23 13:57:58] [INFO ] Deduced a trap composed of 9 places in 443 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-23 13:57:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:57:58] [INFO ] After 25126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1380 ms.
Support contains 169 out of 2713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 90 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2713/2713 places, 2277/2277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 105 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
[2023-03-23 13:57:59] [INFO ] Invariant cache hit.
[2023-03-23 13:58:02] [INFO ] Implicit Places using invariants in 2440 ms returned [2695, 2699]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2444 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2711/2713 places, 2277/2277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2709 transition count 2275
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2709 transition count 2275
Applied a total of 4 rules in 165 ms. Remains 2709 /2711 variables (removed 2) and now considering 2275/2277 (removed 2) transitions.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-23 13:58:02] [INFO ] Computed 1098 place invariants in 38 ms
[2023-03-23 13:58:05] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2023-03-23 13:58:05] [INFO ] Invariant cache hit.
[2023-03-23 13:58:06] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-23 13:58:14] [INFO ] Implicit Places using invariants and state equation in 9934 ms returned []
Implicit Place search using SMT with State Equation took 12403 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2709/2713 places, 2275/2277 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15118 ms. Remains : 2709/2713 places, 2275/2277 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 86206 steps, run timeout after 6001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 86206 steps, saw 64922 distinct states, run finished after 6001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-23 13:58:23] [INFO ] Invariant cache hit.
[2023-03-23 13:58:24] [INFO ] [Real]Absence check using 1098 positive place invariants in 403 ms returned sat
[2023-03-23 13:58:24] [INFO ] After 1757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 13:58:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 303 ms returned sat
[2023-03-23 13:58:31] [INFO ] After 3463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 13:58:31] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-23 13:58:34] [INFO ] After 3090ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 13:58:34] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 1 ms to minimize.
[2023-03-23 13:58:35] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 1 ms to minimize.
[2023-03-23 13:58:35] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 1 ms to minimize.
[2023-03-23 13:58:36] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 0 ms to minimize.
[2023-03-23 13:58:36] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 0 ms to minimize.
[2023-03-23 13:58:37] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2023-03-23 13:58:38] [INFO ] Deduced a trap composed of 5 places in 457 ms of which 1 ms to minimize.
[2023-03-23 13:58:38] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-23 13:58:39] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 0 ms to minimize.
[2023-03-23 13:58:39] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 0 ms to minimize.
[2023-03-23 13:58:40] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 20 ms to minimize.
[2023-03-23 13:58:40] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-23 13:58:41] [INFO ] Deduced a trap composed of 6 places in 489 ms of which 1 ms to minimize.
[2023-03-23 13:58:41] [INFO ] Deduced a trap composed of 11 places in 414 ms of which 1 ms to minimize.
[2023-03-23 13:58:42] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 4 ms to minimize.
[2023-03-23 13:58:42] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-23 13:58:43] [INFO ] Deduced a trap composed of 6 places in 471 ms of which 4 ms to minimize.
[2023-03-23 13:58:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 9324 ms
[2023-03-23 13:58:44] [INFO ] Deduced a trap composed of 6 places in 501 ms of which 1 ms to minimize.
[2023-03-23 13:58:44] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 1 ms to minimize.
[2023-03-23 13:58:45] [INFO ] Deduced a trap composed of 9 places in 461 ms of which 2 ms to minimize.
[2023-03-23 13:58:46] [INFO ] Deduced a trap composed of 8 places in 462 ms of which 2 ms to minimize.
[2023-03-23 13:58:46] [INFO ] Deduced a trap composed of 7 places in 406 ms of which 1 ms to minimize.
[2023-03-23 13:58:47] [INFO ] Deduced a trap composed of 9 places in 451 ms of which 2 ms to minimize.
[2023-03-23 13:58:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3683 ms
[2023-03-23 13:58:49] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2023-03-23 13:58:49] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-23 13:58:50] [INFO ] Deduced a trap composed of 4 places in 434 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-23 13:58:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:58:50] [INFO ] After 25399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1356 ms.
Support contains 169 out of 2709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 91 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 97 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
[2023-03-23 13:58:51] [INFO ] Invariant cache hit.
[2023-03-23 13:58:54] [INFO ] Implicit Places using invariants in 2522 ms returned []
[2023-03-23 13:58:54] [INFO ] Invariant cache hit.
[2023-03-23 13:58:56] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-23 13:59:06] [INFO ] Implicit Places using invariants and state equation in 11680 ms returned []
Implicit Place search using SMT with State Equation took 14222 ms to find 0 implicit places.
[2023-03-23 13:59:06] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-23 13:59:06] [INFO ] Invariant cache hit.
[2023-03-23 13:59:08] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16769 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Partial Free-agglomeration rule applied 536 times.
Drop transitions removed 536 transitions
Iterating global reduction 0 with 536 rules applied. Total rules applied 536 place count 2709 transition count 2275
Applied a total of 536 rules in 230 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-23 13:59:08] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-23 13:59:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 300 ms returned sat
[2023-03-23 13:59:10] [INFO ] After 1717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 13:59:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 338 ms returned sat
[2023-03-23 13:59:16] [INFO ] After 3513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 13:59:16] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-23 13:59:26] [INFO ] After 9561ms SMT Verify possible using 494 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 13:59:27] [INFO ] Deduced a trap composed of 7 places in 763 ms of which 1 ms to minimize.
[2023-03-23 13:59:28] [INFO ] Deduced a trap composed of 7 places in 607 ms of which 2 ms to minimize.
[2023-03-23 13:59:29] [INFO ] Deduced a trap composed of 6 places in 1601 ms of which 1 ms to minimize.
[2023-03-23 13:59:30] [INFO ] Deduced a trap composed of 7 places in 655 ms of which 4 ms to minimize.
[2023-03-23 13:59:31] [INFO ] Deduced a trap composed of 8 places in 1021 ms of which 2 ms to minimize.
[2023-03-23 13:59:32] [INFO ] Deduced a trap composed of 7 places in 853 ms of which 3 ms to minimize.
[2023-03-23 13:59:33] [INFO ] Deduced a trap composed of 8 places in 825 ms of which 3 ms to minimize.
[2023-03-23 13:59:34] [INFO ] Deduced a trap composed of 8 places in 753 ms of which 2 ms to minimize.
[2023-03-23 13:59:35] [INFO ] Deduced a trap composed of 7 places in 780 ms of which 2 ms to minimize.
[2023-03-23 13:59:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 9480 ms
[2023-03-23 13:59:36] [INFO ] Deduced a trap composed of 8 places in 581 ms of which 1 ms to minimize.
[2023-03-23 13:59:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 854 ms
[2023-03-23 13:59:38] [INFO ] Deduced a trap composed of 5 places in 788 ms of which 2 ms to minimize.
[2023-03-23 13:59:39] [INFO ] Deduced a trap composed of 8 places in 774 ms of which 1 ms to minimize.
[2023-03-23 13:59:40] [INFO ] Deduced a trap composed of 6 places in 743 ms of which 1 ms to minimize.
[2023-03-23 13:59:41] [INFO ] Deduced a trap composed of 8 places in 764 ms of which 1 ms to minimize.
[2023-03-23 13:59:41] [INFO ] Deduced a trap composed of 21 places in 567 ms of which 1 ms to minimize.
[2023-03-23 13:59:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4694 ms
[2023-03-23 13:59:43] [INFO ] Deduced a trap composed of 6 places in 697 ms of which 2 ms to minimize.
[2023-03-23 13:59:44] [INFO ] Deduced a trap composed of 5 places in 1082 ms of which 3 ms to minimize.
[2023-03-23 13:59:45] [INFO ] Deduced a trap composed of 5 places in 877 ms of which 3 ms to minimize.
[2023-03-23 13:59:46] [INFO ] Deduced a trap composed of 8 places in 950 ms of which 3 ms to minimize.
[2023-03-23 13:59:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4324 ms
[2023-03-23 13:59:47] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 1 ms to minimize.
[2023-03-23 13:59:48] [INFO ] Deduced a trap composed of 7 places in 663 ms of which 1 ms to minimize.
[2023-03-23 13:59:49] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 2 ms to minimize.
[2023-03-23 13:59:50] [INFO ] Deduced a trap composed of 7 places in 587 ms of which 1 ms to minimize.
[2023-03-23 13:59:51] [INFO ] Deduced a trap composed of 12 places in 620 ms of which 1 ms to minimize.
[2023-03-23 13:59:51] [INFO ] Deduced a trap composed of 9 places in 734 ms of which 1 ms to minimize.
[2023-03-23 13:59:52] [INFO ] Deduced a trap composed of 7 places in 606 ms of which 2 ms to minimize.
[2023-03-23 13:59:53] [INFO ] Deduced a trap composed of 10 places in 631 ms of which 2 ms to minimize.
[2023-03-23 13:59:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6823 ms
[2023-03-23 13:59:55] [INFO ] Deduced a trap composed of 5 places in 639 ms of which 1 ms to minimize.
[2023-03-23 13:59:56] [INFO ] Deduced a trap composed of 5 places in 554 ms of which 2 ms to minimize.
[2023-03-23 13:59:56] [INFO ] Deduced a trap composed of 7 places in 611 ms of which 1 ms to minimize.
[2023-03-23 13:59:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2364 ms
[2023-03-23 13:59:58] [INFO ] Deduced a trap composed of 7 places in 563 ms of which 1 ms to minimize.
[2023-03-23 13:59:59] [INFO ] Deduced a trap composed of 14 places in 602 ms of which 1 ms to minimize.
[2023-03-23 13:59:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1585 ms
[2023-03-23 14:00:00] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 3 ms to minimize.
[2023-03-23 14:00:01] [INFO ] Deduced a trap composed of 6 places in 672 ms of which 2 ms to minimize.
[2023-03-23 14:00:01] [INFO ] Deduced a trap composed of 6 places in 772 ms of which 3 ms to minimize.
[2023-03-23 14:00:02] [INFO ] Deduced a trap composed of 10 places in 757 ms of which 3 ms to minimize.
[2023-03-23 14:00:03] [INFO ] Deduced a trap composed of 7 places in 585 ms of which 2 ms to minimize.
[2023-03-23 14:00:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4383 ms
[2023-03-23 14:00:12] [INFO ] Deduced a trap composed of 7 places in 1157 ms of which 2 ms to minimize.
[2023-03-23 14:00:13] [INFO ] Deduced a trap composed of 9 places in 793 ms of which 2 ms to minimize.
[2023-03-23 14:00:14] [INFO ] Deduced a trap composed of 7 places in 691 ms of which 1 ms to minimize.
[2023-03-23 14:00:15] [INFO ] Deduced a trap composed of 7 places in 694 ms of which 2 ms to minimize.
[2023-03-23 14:00:16] [INFO ] Deduced a trap composed of 8 places in 765 ms of which 2 ms to minimize.
[2023-03-23 14:00:17] [INFO ] Deduced a trap composed of 8 places in 726 ms of which 2 ms to minimize.
[2023-03-23 14:00:18] [INFO ] Deduced a trap composed of 8 places in 641 ms of which 2 ms to minimize.
[2023-03-23 14:00:19] [INFO ] Deduced a trap composed of 8 places in 749 ms of which 2 ms to minimize.
[2023-03-23 14:00:20] [INFO ] Deduced a trap composed of 12 places in 677 ms of which 2 ms to minimize.
[2023-03-23 14:00:21] [INFO ] Deduced a trap composed of 16 places in 716 ms of which 2 ms to minimize.
[2023-03-23 14:00:22] [INFO ] Deduced a trap composed of 9 places in 764 ms of which 1 ms to minimize.
[2023-03-23 14:00:23] [INFO ] Deduced a trap composed of 8 places in 790 ms of which 2 ms to minimize.
[2023-03-23 14:00:24] [INFO ] Deduced a trap composed of 8 places in 692 ms of which 1 ms to minimize.
[2023-03-23 14:00:25] [INFO ] Deduced a trap composed of 11 places in 833 ms of which 2 ms to minimize.
[2023-03-23 14:00:26] [INFO ] Deduced a trap composed of 10 places in 917 ms of which 1 ms to minimize.
[2023-03-23 14:00:27] [INFO ] Deduced a trap composed of 9 places in 685 ms of which 2 ms to minimize.
[2023-03-23 14:00:27] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 15873 ms
[2023-03-23 14:00:28] [INFO ] Deduced a trap composed of 6 places in 606 ms of which 1 ms to minimize.
[2023-03-23 14:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2023-03-23 14:00:28] [INFO ] After 72069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 8430 ms.
[2023-03-23 14:00:37] [INFO ] After 86617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2023-03-23 14:00:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2023-03-23 14:00:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2709 places, 2275 transitions and 9784 arcs took 24 ms.
[2023-03-23 14:00:37] [INFO ] Flatten gal took : 260 ms
Total runtime 235823 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 100B
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: 2709 places, 2275 transitions, 9784 arcs.
Final Score: 311411.555
Took : 98 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679580136832
--------------------
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 15162:
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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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 r395-oct2-167903719100703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B 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 '
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 ;