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-167903719100687.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100687
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 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.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 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 955K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679578110286

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-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:28:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:28:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:28:33] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-23 13:28:33] [INFO ] Transformed 3903 places.
[2023-03-23 13:28:33] [INFO ] Transformed 3553 transitions.
[2023-03-23 13:28:33] [INFO ] Found NUPN structural information;
[2023-03-23 13:28:33] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-23 13:28:34] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-23 13:28:37] [INFO ] [Real]Absence check using 551 positive place invariants in 348 ms returned sat
[2023-03-23 13:28:37] [INFO ] After 2278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 13:28:39] [INFO ] [Nat]Absence check using 551 positive place invariants in 402 ms returned sat
[2023-03-23 13:28:52] [INFO ] After 12506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 13:28:54] [INFO ] Deduced a trap composed of 18 places in 1552 ms of which 15 ms to minimize.
[2023-03-23 13:28:56] [INFO ] Deduced a trap composed of 25 places in 2060 ms of which 2 ms to minimize.
[2023-03-23 13:28:59] [INFO ] Deduced a trap composed of 20 places in 2002 ms of which 32 ms to minimize.
[2023-03-23 13:29:00] [INFO ] Deduced a trap composed of 20 places in 1596 ms of which 29 ms to minimize.
[2023-03-23 13:29:02] [INFO ] Deduced a trap composed of 30 places in 1601 ms of which 2 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:29:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:29:02] [INFO ] After 25423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 2208 ms.
Support contains 252 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 766 transitions
Trivial Post-agglo rules discarded 766 transitions
Performed 766 trivial Post agglomeration. Transition count delta: 766
Iterating post reduction 0 with 766 rules applied. Total rules applied 766 place count 3903 transition count 2787
Reduce places removed 766 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 768 rules applied. Total rules applied 1534 place count 3137 transition count 2785
Reduce places removed 1 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 2 with 66 rules applied. Total rules applied 1600 place count 3136 transition count 2720
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 1665 place count 3071 transition count 2720
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 1665 place count 3071 transition count 2497
Deduced a syphon composed of 223 places in 8 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 2111 place count 2848 transition count 2497
Discarding 301 places :
Symmetric choice reduction at 4 with 301 rule applications. Total rules 2412 place count 2547 transition count 2196
Iterating global reduction 4 with 301 rules applied. Total rules applied 2713 place count 2547 transition count 2196
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 2713 place count 2547 transition count 2093
Deduced a syphon composed of 103 places in 15 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 2919 place count 2444 transition count 2093
Performed 751 Post agglomeration using F-continuation condition.Transition count delta: 751
Deduced a syphon composed of 751 places in 5 ms
Reduce places removed 751 places and 0 transitions.
Iterating global reduction 4 with 1502 rules applied. Total rules applied 4421 place count 1693 transition count 1342
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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4623 place count 1592 transition count 1342
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 4645 place count 1581 transition count 1342
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4655 place count 1581 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 4665 place count 1571 transition count 1332
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 5 with 125 rules applied. Total rules applied 4790 place count 1571 transition count 1332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4791 place count 1570 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4792 place count 1569 transition count 1331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4792 place count 1569 transition count 1329
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4796 place count 1567 transition count 1329
Applied a total of 4796 rules in 1524 ms. Remains 1567 /3903 variables (removed 2336) and now considering 1329/3553 (removed 2224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1525 ms. Remains : 1567/3903 places, 1329/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 72001 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 72001 steps, saw 41694 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1329 rows 1567 cols
[2023-03-23 13:29:10] [INFO ] Computed 550 place invariants in 7 ms
[2023-03-23 13:29:11] [INFO ] [Real]Absence check using 550 positive place invariants in 236 ms returned sat
[2023-03-23 13:29:11] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 13:29:12] [INFO ] [Nat]Absence check using 550 positive place invariants in 199 ms returned sat
[2023-03-23 13:29:14] [INFO ] After 1880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 13:29:14] [INFO ] State equation strengthened by 206 read => feed constraints.
[2023-03-23 13:29:16] [INFO ] After 2180ms SMT Verify possible using 206 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 13:29:17] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 1 ms to minimize.
[2023-03-23 13:29:17] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 1 ms to minimize.
[2023-03-23 13:29:18] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2023-03-23 13:29:18] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-23 13:29:18] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2023-03-23 13:29:19] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 1 ms to minimize.
[2023-03-23 13:29:19] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 0 ms to minimize.
[2023-03-23 13:29:20] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 0 ms to minimize.
[2023-03-23 13:29:20] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-23 13:29:20] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2023-03-23 13:29:20] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2023-03-23 13:29:21] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 1 ms to minimize.
[2023-03-23 13:29:21] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 1 ms to minimize.
[2023-03-23 13:29:22] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2023-03-23 13:29:22] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
[2023-03-23 13:29:22] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2023-03-23 13:29:23] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 14 ms to minimize.
[2023-03-23 13:29:23] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 1 ms to minimize.
[2023-03-23 13:29:24] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 0 ms to minimize.
[2023-03-23 13:29:24] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
[2023-03-23 13:29:24] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 1 ms to minimize.
[2023-03-23 13:29:25] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-23 13:29:25] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-23 13:29:25] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8311 ms
[2023-03-23 13:29:26] [INFO ] Deduced a trap composed of 6 places in 525 ms of which 10 ms to minimize.
[2023-03-23 13:29:27] [INFO ] Deduced a trap composed of 8 places in 495 ms of which 1 ms to minimize.
[2023-03-23 13:29:27] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2023-03-23 13:29:28] [INFO ] Deduced a trap composed of 6 places in 447 ms of which 1 ms to minimize.
[2023-03-23 13:29:29] [INFO ] Deduced a trap composed of 7 places in 1157 ms of which 2 ms to minimize.
[2023-03-23 13:29:30] [INFO ] Deduced a trap composed of 15 places in 606 ms of which 1 ms to minimize.
[2023-03-23 13:29:30] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 1 ms to minimize.
[2023-03-23 13:29:31] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2023-03-23 13:29:31] [INFO ] Deduced a trap composed of 16 places in 494 ms of which 1 ms to minimize.
[2023-03-23 13:29:32] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 1 ms to minimize.
[2023-03-23 13:29:32] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 1 ms to minimize.
[2023-03-23 13:29:33] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 2 ms to minimize.
[2023-03-23 13:29:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7388 ms
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 7 places in 526 ms of which 1 ms to minimize.
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 0 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2061 ms
[2023-03-23 13:29:36] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2023-03-23 13:29:36] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 6 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:29:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:29:36] [INFO ] After 25103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 362 ms.
Support contains 252 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1329/1329 transitions.
Applied a total of 0 rules in 78 ms. Remains 1567 /1567 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1567/1567 places, 1329/1329 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1329/1329 transitions.
Applied a total of 0 rules in 96 ms. Remains 1567 /1567 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2023-03-23 13:29:37] [INFO ] Invariant cache hit.
[2023-03-23 13:29:38] [INFO ] Implicit Places using invariants in 1189 ms returned [1544, 1548]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1565/1567 places, 1329/1329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1563 transition count 1327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1563 transition count 1327
Applied a total of 4 rules in 90 ms. Remains 1563 /1565 variables (removed 2) and now considering 1327/1329 (removed 2) transitions.
// Phase 1: matrix 1327 rows 1563 cols
[2023-03-23 13:29:38] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-23 13:29:39] [INFO ] Implicit Places using invariants in 897 ms returned []
[2023-03-23 13:29:39] [INFO ] Invariant cache hit.
[2023-03-23 13:29:40] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-23 13:29:43] [INFO ] Implicit Places using invariants and state equation in 4010 ms returned []
Implicit Place search using SMT with State Equation took 4922 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1563/1567 places, 1327/1329 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6313 ms. Remains : 1563/1567 places, 1327/1329 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 68442 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68442 steps, saw 41419 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-23 13:29:47] [INFO ] Invariant cache hit.
[2023-03-23 13:29:48] [INFO ] [Real]Absence check using 548 positive place invariants in 247 ms returned sat
[2023-03-23 13:29:48] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 13:29:49] [INFO ] [Nat]Absence check using 548 positive place invariants in 132 ms returned sat
[2023-03-23 13:29:51] [INFO ] After 1897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 13:29:51] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-23 13:29:53] [INFO ] After 2178ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 1 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 0 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 14 ms to minimize.
[2023-03-23 13:29:55] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2023-03-23 13:29:55] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 1 ms to minimize.
[2023-03-23 13:29:55] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2023-03-23 13:29:56] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-23 13:29:56] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 16 ms to minimize.
[2023-03-23 13:29:56] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-23 13:29:57] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2023-03-23 13:29:57] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-23 13:29:57] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-23 13:29:57] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-23 13:29:58] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 1 ms to minimize.
[2023-03-23 13:29:58] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2023-03-23 13:29:58] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 7 ms to minimize.
[2023-03-23 13:29:58] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
[2023-03-23 13:29:59] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
[2023-03-23 13:29:59] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-23 13:29:59] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 1 ms to minimize.
[2023-03-23 13:30:00] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2023-03-23 13:30:00] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-23 13:30:00] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-23 13:30:00] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6945 ms
[2023-03-23 13:30:01] [INFO ] Deduced a trap composed of 3 places in 480 ms of which 1 ms to minimize.
[2023-03-23 13:30:02] [INFO ] Deduced a trap composed of 9 places in 597 ms of which 1 ms to minimize.
[2023-03-23 13:30:03] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 1 ms to minimize.
[2023-03-23 13:30:03] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 2 ms to minimize.
[2023-03-23 13:30:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2302 ms
[2023-03-23 13:30:04] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-23 13:30:05] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2023-03-23 13:30:05] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2023-03-23 13:30:05] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 0 ms to minimize.
[2023-03-23 13:30:06] [INFO ] Deduced a trap composed of 15 places in 485 ms of which 1 ms to minimize.
[2023-03-23 13:30:06] [INFO ] Deduced a trap composed of 14 places in 345 ms of which 0 ms to minimize.
[2023-03-23 13:30:07] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 1 ms to minimize.
[2023-03-23 13:30:07] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 1 ms to minimize.
[2023-03-23 13:30:08] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 1 ms to minimize.
[2023-03-23 13:30:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4024 ms
[2023-03-23 13:30:08] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 1 ms to minimize.
[2023-03-23 13:30:09] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 1 ms to minimize.
[2023-03-23 13:30:09] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 0 ms to minimize.
[2023-03-23 13:30:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1146 ms
[2023-03-23 13:30:10] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-23 13:30:10] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 1 ms to minimize.
[2023-03-23 13:30:11] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-23 13:30:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1322 ms
[2023-03-23 13:30:11] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-23 13:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2023-03-23 13:30:12] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-23 13:30:13] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 1 ms to minimize.
[2023-03-23 13:30:13] [INFO ] Deduced a trap composed of 4 places in 350 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:30:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:30:13] [INFO ] After 25252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 305 ms.
Support contains 252 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1327/1327 transitions.
Applied a total of 0 rules in 43 ms. Remains 1563 /1563 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1563/1563 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1327/1327 transitions.
Applied a total of 0 rules in 37 ms. Remains 1563 /1563 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-23 13:30:14] [INFO ] Invariant cache hit.
[2023-03-23 13:30:14] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-23 13:30:14] [INFO ] Invariant cache hit.
[2023-03-23 13:30:16] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-23 13:30:20] [INFO ] Implicit Places using invariants and state equation in 5128 ms returned []
Implicit Place search using SMT with State Equation took 6043 ms to find 0 implicit places.
[2023-03-23 13:30:20] [INFO ] Redundant transitions in 110 ms returned []
[2023-03-23 13:30:20] [INFO ] Invariant cache hit.
[2023-03-23 13:30:21] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7088 ms. Remains : 1563/1563 places, 1327/1327 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1563 transition count 1327
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 206 place count 1563 transition count 1324
Applied a total of 206 rules in 161 ms. Remains 1563 /1563 variables (removed 0) and now considering 1324/1327 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1324 rows 1563 cols
[2023-03-23 13:30:21] [INFO ] Computed 548 place invariants in 13 ms
[2023-03-23 13:30:22] [INFO ] [Real]Absence check using 548 positive place invariants in 166 ms returned sat
[2023-03-23 13:30:22] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 13:30:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 254 ms returned sat
[2023-03-23 13:30:25] [INFO ] After 2031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 13:30:25] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-23 13:30:28] [INFO ] After 2459ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 13:30:28] [INFO ] Deduced a trap composed of 7 places in 448 ms of which 1 ms to minimize.
[2023-03-23 13:30:28] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2023-03-23 13:30:29] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2023-03-23 13:30:29] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 2 ms to minimize.
[2023-03-23 13:30:30] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-23 13:30:30] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2023-03-23 13:30:30] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 0 ms to minimize.
[2023-03-23 13:30:31] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 0 ms to minimize.
[2023-03-23 13:30:31] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2023-03-23 13:30:32] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-23 13:30:32] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 1 ms to minimize.
[2023-03-23 13:30:32] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 0 ms to minimize.
[2023-03-23 13:30:33] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 0 ms to minimize.
[2023-03-23 13:30:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5128 ms
[2023-03-23 13:30:34] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 1 ms to minimize.
[2023-03-23 13:30:34] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2023-03-23 13:30:35] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2023-03-23 13:30:35] [INFO ] Deduced a trap composed of 8 places in 361 ms of which 1 ms to minimize.
[2023-03-23 13:30:36] [INFO ] Deduced a trap composed of 7 places in 583 ms of which 0 ms to minimize.
[2023-03-23 13:30:36] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 1 ms to minimize.
[2023-03-23 13:30:37] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2023-03-23 13:30:37] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2023-03-23 13:30:38] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2023-03-23 13:30:38] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 1 ms to minimize.
[2023-03-23 13:30:38] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 0 ms to minimize.
[2023-03-23 13:30:39] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 1 ms to minimize.
[2023-03-23 13:30:39] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 1 ms to minimize.
[2023-03-23 13:30:39] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2023-03-23 13:30:40] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2023-03-23 13:30:40] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2023-03-23 13:30:41] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 0 ms to minimize.
[2023-03-23 13:30:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7362 ms
[2023-03-23 13:30:41] [INFO ] Deduced a trap composed of 9 places in 418 ms of which 1 ms to minimize.
[2023-03-23 13:30:42] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2023-03-23 13:30:42] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 1 ms to minimize.
[2023-03-23 13:30:43] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 0 ms to minimize.
[2023-03-23 13:30:43] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 0 ms to minimize.
[2023-03-23 13:30:44] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 1 ms to minimize.
[2023-03-23 13:30:44] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2023-03-23 13:30:44] [INFO ] Deduced a trap composed of 13 places in 393 ms of which 1 ms to minimize.
[2023-03-23 13:30:45] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 1 ms to minimize.
[2023-03-23 13:30:45] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 1 ms to minimize.
[2023-03-23 13:30:46] [INFO ] Deduced a trap composed of 19 places in 377 ms of which 1 ms to minimize.
[2023-03-23 13:30:46] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 0 ms to minimize.
[2023-03-23 13:30:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5231 ms
[2023-03-23 13:30:47] [INFO ] Deduced a trap composed of 13 places in 453 ms of which 1 ms to minimize.
[2023-03-23 13:30:47] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-23 13:30:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 939 ms
[2023-03-23 13:30:48] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 1 ms to minimize.
[2023-03-23 13:30:48] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 0 ms to minimize.
[2023-03-23 13:30:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1025 ms
[2023-03-23 13:30:49] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2023-03-23 13:30:50] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 1 ms to minimize.
[2023-03-23 13:30:50] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-23 13:30:50] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 2 ms to minimize.
[2023-03-23 13:30:51] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2023-03-23 13:30:51] [INFO ] Deduced a trap composed of 15 places in 372 ms of which 3 ms to minimize.
[2023-03-23 13:30:52] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 1 ms to minimize.
[2023-03-23 13:30:52] [INFO ] Deduced a trap composed of 17 places in 519 ms of which 0 ms to minimize.
[2023-03-23 13:30:53] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 1 ms to minimize.
[2023-03-23 13:30:53] [INFO ] Deduced a trap composed of 16 places in 361 ms of which 1 ms to minimize.
[2023-03-23 13:30:54] [INFO ] Deduced a trap composed of 16 places in 309 ms of which 2 ms to minimize.
[2023-03-23 13:30:54] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2023-03-23 13:30:55] [INFO ] Deduced a trap composed of 16 places in 896 ms of which 1 ms to minimize.
[2023-03-23 13:30:56] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2023-03-23 13:30:56] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 1 ms to minimize.
[2023-03-23 13:30:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 7652 ms
[2023-03-23 13:30:57] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2023-03-23 13:30:57] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2023-03-23 13:30:58] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2023-03-23 13:30:58] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 1 ms to minimize.
[2023-03-23 13:30:59] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 0 ms to minimize.
[2023-03-23 13:30:59] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 1 ms to minimize.
[2023-03-23 13:30:59] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2023-03-23 13:31:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2964 ms
[2023-03-23 13:31:00] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 1 ms to minimize.
[2023-03-23 13:31:01] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2023-03-23 13:31:01] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2023-03-23 13:31:01] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 3 ms to minimize.
[2023-03-23 13:31:02] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-23 13:31:02] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2023-03-23 13:31:02] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 1 ms to minimize.
[2023-03-23 13:31:03] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 1 ms to minimize.
[2023-03-23 13:31:03] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2023-03-23 13:31:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3434 ms
[2023-03-23 13:31:04] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 1 ms to minimize.
[2023-03-23 13:31:04] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2023-03-23 13:31:05] [INFO ] Deduced a trap composed of 15 places in 336 ms of which 1 ms to minimize.
[2023-03-23 13:31:05] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2023-03-23 13:31:06] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 1 ms to minimize.
[2023-03-23 13:31:06] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-23 13:31:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2713 ms
[2023-03-23 13:31:07] [INFO ] Deduced a trap composed of 8 places in 415 ms of which 1 ms to minimize.
[2023-03-23 13:31:07] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-23 13:31:08] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-23 13:31:08] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 0 ms to minimize.
[2023-03-23 13:31:08] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 0 ms to minimize.
[2023-03-23 13:31:09] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2023-03-23 13:31:09] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2023-03-23 13:31:09] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2023-03-23 13:31:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2895 ms
[2023-03-23 13:31:10] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-23 13:31:10] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 1 ms to minimize.
[2023-03-23 13:31:11] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 0 ms to minimize.
[2023-03-23 13:31:11] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 1 ms to minimize.
[2023-03-23 13:31:11] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-23 13:31:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1789 ms
[2023-03-23 13:31:11] [INFO ] After 46336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3552 ms.
[2023-03-23 13:31:15] [INFO ] After 53386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-23 13:31:15] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-23 13:31:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1563 places, 1327 transitions and 5222 arcs took 12 ms.
[2023-03-23 13:31:15] [INFO ] Flatten gal took : 144 ms
Total runtime 162935 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 050B
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: 1563 places, 1327 transitions, 5222 arcs.
Final Score: 114831.332
Took : 53 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679578330529

--------------------
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'
++ sed s/.jar//
++ 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 8167:
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-050B"
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-050B, 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-167903719100687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;