About the Execution of Smart+red for ShieldIIPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 993.884 | 215446.00 | 283715.00 | 83.00 | F?FT?F?FFFTT???T | 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-167903718400175.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 ShieldIIPs-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-167903718400175
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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.7M 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 ShieldIIPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679558618652
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=ShieldIIPs-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:03:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 08:03:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:03:41] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2023-03-23 08:03:42] [INFO ] Transformed 6003 places.
[2023-03-23 08:03:42] [INFO ] Transformed 5903 transitions.
[2023-03-23 08:03:42] [INFO ] Found NUPN structural information;
[2023-03-23 08:03:42] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 734 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-23 08:03:43] [INFO ] Computed 901 place invariants in 71 ms
[2023-03-23 08:03:46] [INFO ] After 2466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 08:03:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 958 ms returned sat
[2023-03-23 08:04:11] [INFO ] After 20753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 08:04:11] [INFO ] After 20769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 08:04:11] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 175 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 470 place count 6003 transition count 5433
Reduce places removed 470 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 477 rules applied. Total rules applied 947 place count 5533 transition count 5426
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 954 place count 5526 transition count 5426
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 954 place count 5526 transition count 4930
Deduced a syphon composed of 496 places in 30 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1946 place count 5030 transition count 4930
Discarding 675 places :
Symmetric choice reduction at 3 with 675 rule applications. Total rules 2621 place count 4355 transition count 4255
Iterating global reduction 3 with 675 rules applied. Total rules applied 3296 place count 4355 transition count 4255
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 3296 place count 4355 transition count 4003
Deduced a syphon composed of 252 places in 24 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 3800 place count 4103 transition count 4003
Performed 1444 Post agglomeration using F-continuation condition.Transition count delta: 1444
Deduced a syphon composed of 1444 places in 15 ms
Reduce places removed 1444 places and 0 transitions.
Iterating global reduction 3 with 2888 rules applied. Total rules applied 6688 place count 2659 transition count 2559
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 650 times.
Drop transitions removed 650 transitions
Iterating global reduction 3 with 650 rules applied. Total rules applied 7338 place count 2659 transition count 2559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7339 place count 2658 transition count 2558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7340 place count 2657 transition count 2558
Applied a total of 7340 rules in 2495 ms. Remains 2657 /6003 variables (removed 3346) and now considering 2558/5903 (removed 3345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2497 ms. Remains : 2657/6003 places, 2558/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 10) seen :4
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2558 rows 2657 cols
[2023-03-23 08:04:15] [INFO ] Computed 900 place invariants in 83 ms
[2023-03-23 08:04:15] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:04:17] [INFO ] [Nat]Absence check using 881 positive place invariants in 328 ms returned sat
[2023-03-23 08:04:17] [INFO ] [Nat]Absence check using 881 positive and 19 generalized place invariants in 25 ms returned sat
[2023-03-23 08:04:20] [INFO ] After 3284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:04:21] [INFO ] Deduced a trap composed of 10 places in 759 ms of which 15 ms to minimize.
[2023-03-23 08:04:22] [INFO ] Deduced a trap composed of 6 places in 830 ms of which 1 ms to minimize.
[2023-03-23 08:04:23] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 15 ms to minimize.
[2023-03-23 08:04:24] [INFO ] Deduced a trap composed of 7 places in 575 ms of which 2 ms to minimize.
[2023-03-23 08:04:25] [INFO ] Deduced a trap composed of 5 places in 557 ms of which 9 ms to minimize.
[2023-03-23 08:04:25] [INFO ] Deduced a trap composed of 8 places in 630 ms of which 2 ms to minimize.
[2023-03-23 08:04:26] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-23 08:04:27] [INFO ] Deduced a trap composed of 8 places in 430 ms of which 1 ms to minimize.
[2023-03-23 08:04:27] [INFO ] Deduced a trap composed of 10 places in 561 ms of which 1 ms to minimize.
[2023-03-23 08:04:28] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2023-03-23 08:04:28] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-23 08:04:29] [INFO ] Deduced a trap composed of 9 places in 451 ms of which 0 ms to minimize.
[2023-03-23 08:04:30] [INFO ] Deduced a trap composed of 10 places in 532 ms of which 1 ms to minimize.
[2023-03-23 08:04:30] [INFO ] Deduced a trap composed of 7 places in 435 ms of which 1 ms to minimize.
[2023-03-23 08:04:31] [INFO ] Deduced a trap composed of 8 places in 688 ms of which 1 ms to minimize.
[2023-03-23 08:04:32] [INFO ] Deduced a trap composed of 10 places in 588 ms of which 10 ms to minimize.
[2023-03-23 08:04:32] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 1 ms to minimize.
[2023-03-23 08:04:33] [INFO ] Deduced a trap composed of 15 places in 405 ms of which 0 ms to minimize.
[2023-03-23 08:04:33] [INFO ] Deduced a trap composed of 13 places in 535 ms of which 23 ms to minimize.
[2023-03-23 08:04:34] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 1 ms to minimize.
[2023-03-23 08:04:34] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 1 ms to minimize.
[2023-03-23 08:04:35] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-23 08:04:35] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2023-03-23 08:04:36] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 1 ms to minimize.
[2023-03-23 08:04:36] [INFO ] Deduced a trap composed of 8 places in 383 ms of which 1 ms to minimize.
[2023-03-23 08:04:37] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 1 ms to minimize.
[2023-03-23 08:04:37] [INFO ] Deduced a trap composed of 15 places in 409 ms of which 0 ms to minimize.
[2023-03-23 08:04:38] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 0 ms to minimize.
[2023-03-23 08:04:38] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-23 08:04:39] [INFO ] Deduced a trap composed of 17 places in 465 ms of which 0 ms to minimize.
[2023-03-23 08:04:39] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 1 ms to minimize.
[2023-03-23 08:04:40] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2023-03-23 08:04:40] [INFO ] Deduced a trap composed of 12 places in 334 ms of which 0 ms to minimize.
[2023-03-23 08:04:43] [INFO ] Deduced a trap composed of 2 places in 2813 ms of which 16 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 08:04:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:04:43] [INFO ] After 27851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 828 ms.
Support contains 125 out of 2657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2657/2657 places, 2558/2558 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2657 transition count 2554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2653 transition count 2554
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 2653 transition count 2545
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 2644 transition count 2545
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 10 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 84 place count 2615 transition count 2516
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 2615 transition count 2516
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 2613 transition count 2514
Applied a total of 100 rules in 478 ms. Remains 2613 /2657 variables (removed 44) and now considering 2514/2558 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 2613/2657 places, 2514/2558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 57795 steps, run timeout after 3008 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57795 steps, saw 55884 distinct states, run finished after 3010 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2514 rows 2613 cols
[2023-03-23 08:04:49] [INFO ] Computed 900 place invariants in 81 ms
[2023-03-23 08:04:50] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:04:51] [INFO ] [Nat]Absence check using 886 positive place invariants in 288 ms returned sat
[2023-03-23 08:04:51] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-23 08:04:55] [INFO ] After 3802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:04:56] [INFO ] Deduced a trap composed of 6 places in 449 ms of which 0 ms to minimize.
[2023-03-23 08:04:57] [INFO ] Deduced a trap composed of 6 places in 439 ms of which 1 ms to minimize.
[2023-03-23 08:04:57] [INFO ] Deduced a trap composed of 9 places in 571 ms of which 1 ms to minimize.
[2023-03-23 08:04:58] [INFO ] Deduced a trap composed of 7 places in 524 ms of which 0 ms to minimize.
[2023-03-23 08:04:59] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2023-03-23 08:04:59] [INFO ] Deduced a trap composed of 8 places in 525 ms of which 14 ms to minimize.
[2023-03-23 08:05:00] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 1 ms to minimize.
[2023-03-23 08:05:00] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 1 ms to minimize.
[2023-03-23 08:05:01] [INFO ] Deduced a trap composed of 10 places in 392 ms of which 0 ms to minimize.
[2023-03-23 08:05:02] [INFO ] Deduced a trap composed of 10 places in 438 ms of which 1 ms to minimize.
[2023-03-23 08:05:02] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-23 08:05:03] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 1 ms to minimize.
[2023-03-23 08:05:03] [INFO ] Deduced a trap composed of 10 places in 439 ms of which 1 ms to minimize.
[2023-03-23 08:05:04] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 0 ms to minimize.
[2023-03-23 08:05:04] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2023-03-23 08:05:04] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 0 ms to minimize.
[2023-03-23 08:05:05] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-23 08:05:05] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2023-03-23 08:05:06] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2023-03-23 08:05:06] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 0 ms to minimize.
[2023-03-23 08:05:07] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 1 ms to minimize.
[2023-03-23 08:05:07] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 0 ms to minimize.
[2023-03-23 08:05:07] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 13 ms to minimize.
[2023-03-23 08:05:08] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 1 ms to minimize.
[2023-03-23 08:05:08] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 1 ms to minimize.
[2023-03-23 08:05:09] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-23 08:05:09] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2023-03-23 08:05:09] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 0 ms to minimize.
[2023-03-23 08:05:10] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-23 08:05:10] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 9 ms to minimize.
[2023-03-23 08:05:10] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 4 ms to minimize.
[2023-03-23 08:05:11] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-23 08:05:11] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-23 08:05:12] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 0 ms to minimize.
[2023-03-23 08:05:12] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 28 ms to minimize.
[2023-03-23 08:05:12] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2023-03-23 08:05:13] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 0 ms to minimize.
[2023-03-23 08:05:13] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-23 08:05:14] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-03-23 08:05:14] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 1 ms to minimize.
[2023-03-23 08:05:15] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2023-03-23 08:05:15] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2023-03-23 08:05:15] [INFO ] Deduced a trap composed of 10 places in 263 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 08:05:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:05:15] [INFO ] After 25245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1272 ms.
Support contains 125 out of 2613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 109 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 78 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-23 08:05:17] [INFO ] Invariant cache hit.
[2023-03-23 08:05:19] [INFO ] Implicit Places using invariants in 2693 ms returned []
[2023-03-23 08:05:19] [INFO ] Invariant cache hit.
[2023-03-23 08:05:25] [INFO ] Implicit Places using invariants and state equation in 5147 ms returned []
Implicit Place search using SMT with State Equation took 7850 ms to find 0 implicit places.
[2023-03-23 08:05:25] [INFO ] Redundant transitions in 293 ms returned []
[2023-03-23 08:05:25] [INFO ] Invariant cache hit.
[2023-03-23 08:05:27] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10299 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 113 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-23 08:05:27] [INFO ] Invariant cache hit.
[2023-03-23 08:05:28] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:05:29] [INFO ] [Nat]Absence check using 886 positive place invariants in 603 ms returned sat
[2023-03-23 08:05:29] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-23 08:05:33] [INFO ] After 4052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:05:34] [INFO ] Deduced a trap composed of 8 places in 727 ms of which 1 ms to minimize.
[2023-03-23 08:05:35] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 1 ms to minimize.
[2023-03-23 08:05:36] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-23 08:05:36] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 1 ms to minimize.
[2023-03-23 08:05:37] [INFO ] Deduced a trap composed of 9 places in 540 ms of which 1 ms to minimize.
[2023-03-23 08:05:38] [INFO ] Deduced a trap composed of 3 places in 703 ms of which 1 ms to minimize.
[2023-03-23 08:05:38] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-23 08:05:39] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-23 08:05:39] [INFO ] Deduced a trap composed of 7 places in 513 ms of which 1 ms to minimize.
[2023-03-23 08:05:40] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 0 ms to minimize.
[2023-03-23 08:05:40] [INFO ] Deduced a trap composed of 6 places in 477 ms of which 1 ms to minimize.
[2023-03-23 08:05:41] [INFO ] Deduced a trap composed of 12 places in 483 ms of which 1 ms to minimize.
[2023-03-23 08:05:42] [INFO ] Deduced a trap composed of 5 places in 598 ms of which 1 ms to minimize.
[2023-03-23 08:05:43] [INFO ] Deduced a trap composed of 11 places in 547 ms of which 1 ms to minimize.
[2023-03-23 08:05:43] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 1 ms to minimize.
[2023-03-23 08:05:44] [INFO ] Deduced a trap composed of 8 places in 483 ms of which 1 ms to minimize.
[2023-03-23 08:05:45] [INFO ] Deduced a trap composed of 10 places in 544 ms of which 1 ms to minimize.
[2023-03-23 08:05:45] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 1 ms to minimize.
[2023-03-23 08:05:46] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2023-03-23 08:05:46] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 1 ms to minimize.
[2023-03-23 08:05:46] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-23 08:05:47] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 1 ms to minimize.
[2023-03-23 08:05:47] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 0 ms to minimize.
[2023-03-23 08:05:48] [INFO ] Deduced a trap composed of 5 places in 487 ms of which 1 ms to minimize.
[2023-03-23 08:05:48] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 2 ms to minimize.
[2023-03-23 08:05:49] [INFO ] Deduced a trap composed of 6 places in 478 ms of which 0 ms to minimize.
[2023-03-23 08:05:49] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-23 08:05:50] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-23 08:05:50] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-23 08:05:50] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-23 08:05:51] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 0 ms to minimize.
[2023-03-23 08:05:51] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2023-03-23 08:05:52] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2023-03-23 08:05:52] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 1 ms to minimize.
[2023-03-23 08:05:53] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2023-03-23 08:05:53] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 0 ms to minimize.
[2023-03-23 08:05:54] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 1 ms to minimize.
[2023-03-23 08:05:54] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2023-03-23 08:05:55] [INFO ] Deduced a trap composed of 16 places in 365 ms of which 1 ms to minimize.
[2023-03-23 08:05:55] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-23 08:05:56] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2023-03-23 08:05:56] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 0 ms to minimize.
[2023-03-23 08:05:56] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 1 ms to minimize.
[2023-03-23 08:05:57] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 0 ms to minimize.
[2023-03-23 08:05:57] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 1 ms to minimize.
[2023-03-23 08:05:58] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-23 08:05:58] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-23 08:05:58] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 1 ms to minimize.
[2023-03-23 08:05:59] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2023-03-23 08:05:59] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 25344 ms
[2023-03-23 08:06:00] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-23 08:06:00] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 1 ms to minimize.
[2023-03-23 08:06:00] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
[2023-03-23 08:06:01] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-23 08:06:01] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2023-03-23 08:06:02] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-23 08:06:02] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2023-03-23 08:06:03] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 1 ms to minimize.
[2023-03-23 08:06:03] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-23 08:06:03] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 1 ms to minimize.
[2023-03-23 08:06:04] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2023-03-23 08:06:04] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 0 ms to minimize.
[2023-03-23 08:06:05] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 1 ms to minimize.
[2023-03-23 08:06:05] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2023-03-23 08:06:05] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 0 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2023-03-23 08:06:06] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 0 ms to minimize.
[2023-03-23 08:06:07] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-23 08:06:07] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 0 ms to minimize.
[2023-03-23 08:06:08] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 1 ms to minimize.
[2023-03-23 08:06:08] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8564 ms
[2023-03-23 08:06:09] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 1 ms to minimize.
[2023-03-23 08:06:09] [INFO ] Deduced a trap composed of 8 places in 426 ms of which 1 ms to minimize.
[2023-03-23 08:06:10] [INFO ] Deduced a trap composed of 16 places in 431 ms of which 1 ms to minimize.
[2023-03-23 08:06:10] [INFO ] Deduced a trap composed of 7 places in 432 ms of which 1 ms to minimize.
[2023-03-23 08:06:11] [INFO ] Deduced a trap composed of 14 places in 440 ms of which 0 ms to minimize.
[2023-03-23 08:06:12] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 1 ms to minimize.
[2023-03-23 08:06:12] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 1 ms to minimize.
[2023-03-23 08:06:13] [INFO ] Deduced a trap composed of 9 places in 434 ms of which 0 ms to minimize.
[2023-03-23 08:06:13] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 1 ms to minimize.
[2023-03-23 08:06:14] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 0 ms to minimize.
[2023-03-23 08:06:14] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2023-03-23 08:06:15] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2023-03-23 08:06:15] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-23 08:06:16] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 1 ms to minimize.
[2023-03-23 08:06:17] [INFO ] Deduced a trap composed of 11 places in 404 ms of which 1 ms to minimize.
[2023-03-23 08:06:17] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2023-03-23 08:06:18] [INFO ] Deduced a trap composed of 14 places in 571 ms of which 1 ms to minimize.
[2023-03-23 08:06:19] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2023-03-23 08:06:19] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 23 ms to minimize.
[2023-03-23 08:06:20] [INFO ] Deduced a trap composed of 12 places in 363 ms of which 1 ms to minimize.
[2023-03-23 08:06:20] [INFO ] Deduced a trap composed of 13 places in 538 ms of which 0 ms to minimize.
[2023-03-23 08:06:21] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-23 08:06:21] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-23 08:06:22] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 1 ms to minimize.
[2023-03-23 08:06:22] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-23 08:06:23] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 0 ms to minimize.
[2023-03-23 08:06:23] [INFO ] Deduced a trap composed of 7 places in 435 ms of which 1 ms to minimize.
[2023-03-23 08:06:24] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 1 ms to minimize.
[2023-03-23 08:06:24] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 0 ms to minimize.
[2023-03-23 08:06:25] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 0 ms to minimize.
[2023-03-23 08:06:25] [INFO ] Deduced a trap composed of 20 places in 596 ms of which 0 ms to minimize.
[2023-03-23 08:06:26] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 1 ms to minimize.
[2023-03-23 08:06:26] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 0 ms to minimize.
[2023-03-23 08:06:27] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 2 ms to minimize.
[2023-03-23 08:06:28] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 1 ms to minimize.
[2023-03-23 08:06:28] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 0 ms to minimize.
[2023-03-23 08:06:28] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 1 ms to minimize.
[2023-03-23 08:06:29] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 1 ms to minimize.
[2023-03-23 08:06:29] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 0 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 0 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 0 ms to minimize.
[2023-03-23 08:06:30] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 0 ms to minimize.
[2023-03-23 08:06:31] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 0 ms to minimize.
[2023-03-23 08:06:32] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-23 08:06:32] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 1 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2023-03-23 08:06:33] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 1 ms to minimize.
[2023-03-23 08:06:34] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2023-03-23 08:06:34] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-23 08:06:34] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 26153 ms
[2023-03-23 08:06:35] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2023-03-23 08:06:36] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-23 08:06:36] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 1 ms to minimize.
[2023-03-23 08:06:37] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 1 ms to minimize.
[2023-03-23 08:06:37] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-23 08:06:37] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2023-03-23 08:06:39] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2023-03-23 08:06:39] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2023-03-23 08:06:39] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 0 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2023-03-23 08:06:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-23 08:06:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5455 ms
[2023-03-23 08:06:41] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2023-03-23 08:06:41] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 1 ms to minimize.
[2023-03-23 08:06:42] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2023-03-23 08:06:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1151 ms
[2023-03-23 08:06:42] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 1 ms to minimize.
[2023-03-23 08:06:43] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-23 08:06:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 782 ms
[2023-03-23 08:06:43] [INFO ] After 73498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2366 ms.
[2023-03-23 08:06:45] [INFO ] After 77404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-23 08:06:45] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-23 08:06:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2613 places, 2514 transitions and 12346 arcs took 33 ms.
[2023-03-23 08:06:46] [INFO ] Flatten gal took : 390 ms
Total runtime 184979 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (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: 2613 places, 2514 transitions, 12346 arcs.
Final Score: 610120.532
Took : 27 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679558834098
--------------------
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:
++ 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
++ sed s/.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 17559:
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="ShieldIIPs-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 ShieldIIPs-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-167903718400175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-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 ;