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.r011-oct2-167813600300511.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 AutoFlight-PT-48b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600300511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 956K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678737753919

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=AutoFlight-PT-48b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:02:37] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-13 20:02:37] [INFO ] Transformed 3950 places.
[2023-03-13 20:02:37] [INFO ] Transformed 3936 transitions.
[2023-03-13 20:02:37] [INFO ] Found NUPN structural information;
[2023-03-13 20:02:37] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-48b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3936 rows 3950 cols
[2023-03-13 20:02:38] [INFO ] Computed 258 place invariants in 65 ms
[2023-03-13 20:02:39] [INFO ] After 1170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 20:02:41] [INFO ] [Nat]Absence check using 257 positive place invariants in 295 ms returned sat
[2023-03-13 20:02:41] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 20:02:48] [INFO ] After 6002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 20:02:51] [INFO ] Deduced a trap composed of 21 places in 2674 ms of which 41 ms to minimize.
[2023-03-13 20:02:54] [INFO ] Deduced a trap composed of 42 places in 2595 ms of which 4 ms to minimize.
[2023-03-13 20:02:57] [INFO ] Deduced a trap composed of 144 places in 2692 ms of which 4 ms to minimize.
[2023-03-13 20:03:00] [INFO ] Deduced a trap composed of 454 places in 2526 ms of which 9 ms to minimize.
[2023-03-13 20:03:02] [INFO ] Deduced a trap composed of 159 places in 1959 ms of which 33 ms to minimize.
[2023-03-13 20:03:04] [INFO ] Deduced a trap composed of 158 places in 2158 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-13 20:03:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:03:04] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 714 ms.
Support contains 93 out of 3950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions removed 1598 transitions
Trivial Post-agglo rules discarded 1598 transitions
Performed 1598 trivial Post agglomeration. Transition count delta: 1598
Iterating post reduction 0 with 1598 rules applied. Total rules applied 1598 place count 3950 transition count 2338
Reduce places removed 1598 places and 0 transitions.
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 1 with 1846 rules applied. Total rules applied 3444 place count 2352 transition count 2090
Reduce places removed 76 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 116 rules applied. Total rules applied 3560 place count 2276 transition count 2050
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 3606 place count 2236 transition count 2044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3607 place count 2235 transition count 2044
Performed 481 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 481 Pre rules applied. Total rules applied 3607 place count 2235 transition count 1563
Deduced a syphon composed of 481 places in 11 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 5 with 962 rules applied. Total rules applied 4569 place count 1754 transition count 1563
Discarding 322 places :
Symmetric choice reduction at 5 with 322 rule applications. Total rules 4891 place count 1432 transition count 1241
Iterating global reduction 5 with 322 rules applied. Total rules applied 5213 place count 1432 transition count 1241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 7 rules applied. Total rules applied 5220 place count 1432 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 5222 place count 1430 transition count 1234
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 96 Pre rules applied. Total rules applied 5222 place count 1430 transition count 1138
Deduced a syphon composed of 96 places in 9 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 5414 place count 1334 transition count 1138
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 327
Deduced a syphon composed of 327 places in 2 ms
Reduce places removed 327 places and 0 transitions.
Iterating global reduction 7 with 654 rules applied. Total rules applied 6068 place count 1007 transition count 811
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 6077 place count 1007 transition count 802
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 6083 place count 1004 transition count 799
Free-agglomeration rule applied 131 times.
Iterating global reduction 7 with 131 rules applied. Total rules applied 6214 place count 1004 transition count 668
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 7 with 131 rules applied. Total rules applied 6345 place count 873 transition count 668
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 6346 place count 872 transition count 667
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 6365 place count 853 transition count 667
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 17 Pre rules applied. Total rules applied 6365 place count 853 transition count 650
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 6399 place count 836 transition count 650
Applied a total of 6399 rules in 906 ms. Remains 836 /3950 variables (removed 3114) and now considering 650/3936 (removed 3286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 836/3950 places, 650/3936 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 650 rows 836 cols
[2023-03-13 20:03:07] [INFO ] Computed 239 place invariants in 5 ms
[2023-03-13 20:03:07] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:03:07] [INFO ] [Nat]Absence check using 237 positive place invariants in 56 ms returned sat
[2023-03-13 20:03:07] [INFO ] [Nat]Absence check using 237 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-13 20:03:08] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:03:08] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-13 20:03:09] [INFO ] After 925ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:03:10] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2023-03-13 20:03:10] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-13 20:03:10] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2023-03-13 20:03:11] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2023-03-13 20:03:11] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-13 20:03:12] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-13 20:03:12] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2023-03-13 20:03:12] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 0 ms to minimize.
[2023-03-13 20:03:13] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2023-03-13 20:03:13] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-13 20:03:13] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 0 ms to minimize.
[2023-03-13 20:03:13] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 0 ms to minimize.
[2023-03-13 20:03:14] [INFO ] Deduced a trap composed of 280 places in 371 ms of which 1 ms to minimize.
[2023-03-13 20:03:14] [INFO ] Deduced a trap composed of 213 places in 266 ms of which 1 ms to minimize.
[2023-03-13 20:03:15] [INFO ] Deduced a trap composed of 225 places in 464 ms of which 1 ms to minimize.
[2023-03-13 20:03:15] [INFO ] Deduced a trap composed of 221 places in 256 ms of which 14 ms to minimize.
[2023-03-13 20:03:15] [INFO ] Deduced a trap composed of 225 places in 368 ms of which 1 ms to minimize.
[2023-03-13 20:03:16] [INFO ] Deduced a trap composed of 223 places in 156 ms of which 1 ms to minimize.
[2023-03-13 20:03:16] [INFO ] Deduced a trap composed of 220 places in 584 ms of which 1 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Deduced a trap composed of 225 places in 160 ms of which 0 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Deduced a trap composed of 225 places in 275 ms of which 1 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Deduced a trap composed of 231 places in 234 ms of which 0 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Deduced a trap composed of 221 places in 234 ms of which 1 ms to minimize.
[2023-03-13 20:03:18] [INFO ] Deduced a trap composed of 221 places in 174 ms of which 1 ms to minimize.
[2023-03-13 20:03:18] [INFO ] Deduced a trap composed of 220 places in 240 ms of which 0 ms to minimize.
[2023-03-13 20:03:18] [INFO ] Deduced a trap composed of 224 places in 179 ms of which 1 ms to minimize.
[2023-03-13 20:03:18] [INFO ] Deduced a trap composed of 224 places in 143 ms of which 1 ms to minimize.
[2023-03-13 20:03:19] [INFO ] Deduced a trap composed of 230 places in 143 ms of which 4 ms to minimize.
[2023-03-13 20:03:19] [INFO ] Deduced a trap composed of 225 places in 175 ms of which 1 ms to minimize.
[2023-03-13 20:03:19] [INFO ] Deduced a trap composed of 227 places in 437 ms of which 0 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Deduced a trap composed of 227 places in 234 ms of which 1 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Deduced a trap composed of 225 places in 182 ms of which 0 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Deduced a trap composed of 229 places in 209 ms of which 2 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Deduced a trap composed of 231 places in 181 ms of which 2 ms to minimize.
[2023-03-13 20:03:21] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-13 20:03:21] [INFO ] Deduced a trap composed of 233 places in 303 ms of which 1 ms to minimize.
[2023-03-13 20:03:21] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 10 ms to minimize.
[2023-03-13 20:03:22] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 1 ms to minimize.
[2023-03-13 20:03:22] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 0 ms to minimize.
[2023-03-13 20:03:22] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 1 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Deduced a trap composed of 237 places in 176 ms of which 0 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Deduced a trap composed of 242 places in 183 ms of which 1 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Deduced a trap composed of 243 places in 160 ms of which 0 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 0 ms to minimize.
[2023-03-13 20:03:24] [INFO ] Deduced a trap composed of 243 places in 209 ms of which 1 ms to minimize.
[2023-03-13 20:03:24] [INFO ] Deduced a trap composed of 247 places in 203 ms of which 0 ms to minimize.
[2023-03-13 20:03:24] [INFO ] Deduced a trap composed of 252 places in 179 ms of which 0 ms to minimize.
[2023-03-13 20:03:25] [INFO ] Deduced a trap composed of 249 places in 435 ms of which 1 ms to minimize.
[2023-03-13 20:03:25] [INFO ] Deduced a trap composed of 312 places in 229 ms of which 1 ms to minimize.
[2023-03-13 20:03:25] [INFO ] Deduced a trap composed of 256 places in 241 ms of which 0 ms to minimize.
[2023-03-13 20:03:25] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 1 ms to minimize.
[2023-03-13 20:03:26] [INFO ] Deduced a trap composed of 361 places in 284 ms of which 1 ms to minimize.
[2023-03-13 20:03:26] [INFO ] Deduced a trap composed of 362 places in 249 ms of which 1 ms to minimize.
[2023-03-13 20:03:26] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 16646 ms
[2023-03-13 20:03:27] [INFO ] After 18476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 892 ms.
[2023-03-13 20:03:28] [INFO ] After 20915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA AutoFlight-PT-48b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 145 ms.
Support contains 50 out of 836 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 836/836 places, 650/650 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 836 transition count 630
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 816 transition count 626
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 812 transition count 626
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 812 transition count 612
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 78 place count 796 transition count 612
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 796 transition count 610
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 794 transition count 610
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 114 place count 778 transition count 594
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 777 transition count 594
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 777 transition count 585
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 134 place count 768 transition count 585
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 768 transition count 585
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 765 transition count 582
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 765 transition count 582
Applied a total of 143 rules in 229 ms. Remains 765 /836 variables (removed 71) and now considering 582/650 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 765/836 places, 582/650 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 582 rows 765 cols
[2023-03-13 20:03:28] [INFO ] Computed 237 place invariants in 5 ms
[2023-03-13 20:03:28] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:03:29] [INFO ] [Nat]Absence check using 235 positive place invariants in 68 ms returned sat
[2023-03-13 20:03:29] [INFO ] [Nat]Absence check using 235 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 20:03:30] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:03:30] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-13 20:03:30] [INFO ] After 330ms SMT Verify possible using 323 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:03:31] [INFO ] Deduced a trap composed of 16 places in 329 ms of which 1 ms to minimize.
[2023-03-13 20:03:31] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 0 ms to minimize.
[2023-03-13 20:03:31] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2023-03-13 20:03:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1087 ms
[2023-03-13 20:03:31] [INFO ] After 1798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 617 ms.
[2023-03-13 20:03:32] [INFO ] After 3579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 39 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 582/582 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 0 with 1 rules applied. Total rules applied 1 place count 765 transition count 581
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 764 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 763 transition count 580
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 763 transition count 577
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 11 place count 759 transition count 577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 759 transition count 576
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 758 transition count 576
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 23 place count 753 transition count 571
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 753 transition count 568
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 750 transition count 568
Applied a total of 29 rules in 119 ms. Remains 750 /765 variables (removed 15) and now considering 568/582 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 750/765 places, 568/582 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227879 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227879 steps, saw 68039 distinct states, run finished after 3006 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 750 cols
[2023-03-13 20:03:35] [INFO ] Computed 236 place invariants in 8 ms
[2023-03-13 20:03:35] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:03:36] [INFO ] [Nat]Absence check using 234 positive place invariants in 54 ms returned sat
[2023-03-13 20:03:36] [INFO ] [Nat]Absence check using 234 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-13 20:03:36] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:03:36] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-13 20:03:37] [INFO ] After 298ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:03:37] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 1 ms to minimize.
[2023-03-13 20:03:38] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2023-03-13 20:03:38] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2023-03-13 20:03:38] [INFO ] Deduced a trap composed of 301 places in 328 ms of which 26 ms to minimize.
[2023-03-13 20:03:38] [INFO ] Deduced a trap composed of 292 places in 190 ms of which 0 ms to minimize.
[2023-03-13 20:03:39] [INFO ] Deduced a trap composed of 298 places in 701 ms of which 1 ms to minimize.
[2023-03-13 20:03:39] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 1 ms to minimize.
[2023-03-13 20:03:40] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 0 ms to minimize.
[2023-03-13 20:03:40] [INFO ] Deduced a trap composed of 303 places in 180 ms of which 0 ms to minimize.
[2023-03-13 20:03:40] [INFO ] Deduced a trap composed of 300 places in 197 ms of which 1 ms to minimize.
[2023-03-13 20:03:41] [INFO ] Deduced a trap composed of 306 places in 325 ms of which 0 ms to minimize.
[2023-03-13 20:03:41] [INFO ] Deduced a trap composed of 302 places in 216 ms of which 0 ms to minimize.
[2023-03-13 20:03:41] [INFO ] Deduced a trap composed of 302 places in 172 ms of which 0 ms to minimize.
[2023-03-13 20:03:41] [INFO ] Deduced a trap composed of 307 places in 291 ms of which 1 ms to minimize.
[2023-03-13 20:03:42] [INFO ] Deduced a trap composed of 308 places in 170 ms of which 0 ms to minimize.
[2023-03-13 20:03:42] [INFO ] Deduced a trap composed of 308 places in 144 ms of which 1 ms to minimize.
[2023-03-13 20:03:42] [INFO ] Deduced a trap composed of 310 places in 193 ms of which 1 ms to minimize.
[2023-03-13 20:03:42] [INFO ] Deduced a trap composed of 347 places in 169 ms of which 1 ms to minimize.
[2023-03-13 20:03:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5433 ms
[2023-03-13 20:03:42] [INFO ] After 6007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-13 20:03:43] [INFO ] After 7061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 135 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=45 )
FORMULA AutoFlight-PT-48b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 66281 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 48b
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: 3950 places, 3936 transitions, 9104 arcs.
Final Score: 1014295.665
Took : 23 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 14542308 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16102792 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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="AutoFlight-PT-48b"
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 AutoFlight-PT-48b, 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 r011-oct2-167813600300511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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