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.r010-oct2-167813599100495.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 marciexred
Input is AutoFlight-PT-24b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 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.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 538K 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-24b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678693552841

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:45:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:45:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:45:55] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-13 07:45:55] [INFO ] Transformed 2230 places.
[2023-03-13 07:45:55] [INFO ] Transformed 2228 transitions.
[2023-03-13 07:45:55] [INFO ] Found NUPN structural information;
[2023-03-13 07:45:55] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-24b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-24b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-13 07:45:56] [INFO ] Computed 148 place invariants in 37 ms
[2023-03-13 07:45:57] [INFO ] After 989ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 07:45:58] [INFO ] [Nat]Absence check using 147 positive place invariants in 146 ms returned sat
[2023-03-13 07:45:58] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-13 07:46:00] [INFO ] After 2425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 07:46:02] [INFO ] Deduced a trap composed of 19 places in 1022 ms of which 13 ms to minimize.
[2023-03-13 07:46:03] [INFO ] Deduced a trap composed of 42 places in 970 ms of which 6 ms to minimize.
[2023-03-13 07:46:04] [INFO ] Deduced a trap composed of 247 places in 836 ms of which 2 ms to minimize.
[2023-03-13 07:46:05] [INFO ] Deduced a trap composed of 72 places in 829 ms of which 15 ms to minimize.
[2023-03-13 07:46:06] [INFO ] Deduced a trap composed of 69 places in 832 ms of which 2 ms to minimize.
[2023-03-13 07:46:07] [INFO ] Deduced a trap composed of 73 places in 827 ms of which 7 ms to minimize.
[2023-03-13 07:46:08] [INFO ] Deduced a trap composed of 250 places in 880 ms of which 27 ms to minimize.
[2023-03-13 07:46:09] [INFO ] Deduced a trap composed of 258 places in 658 ms of which 2 ms to minimize.
[2023-03-13 07:46:09] [INFO ] Deduced a trap composed of 220 places in 697 ms of which 1 ms to minimize.
[2023-03-13 07:46:11] [INFO ] Deduced a trap composed of 232 places in 1230 ms of which 1 ms to minimize.
[2023-03-13 07:46:12] [INFO ] Deduced a trap composed of 84 places in 676 ms of which 2 ms to minimize.
[2023-03-13 07:46:13] [INFO ] Deduced a trap composed of 78 places in 1102 ms of which 4 ms to minimize.
[2023-03-13 07:46:14] [INFO ] Deduced a trap composed of 247 places in 773 ms of which 1 ms to minimize.
[2023-03-13 07:46:15] [INFO ] Deduced a trap composed of 256 places in 842 ms of which 2 ms to minimize.
[2023-03-13 07:46:16] [INFO ] Deduced a trap composed of 239 places in 703 ms of which 1 ms to minimize.
[2023-03-13 07:46:16] [INFO ] Deduced a trap composed of 86 places in 655 ms of which 3 ms to minimize.
[2023-03-13 07:46:17] [INFO ] Deduced a trap composed of 82 places in 689 ms of which 1 ms to minimize.
[2023-03-13 07:46:18] [INFO ] Deduced a trap composed of 88 places in 700 ms of which 1 ms to minimize.
[2023-03-13 07:46:19] [INFO ] Deduced a trap composed of 236 places in 656 ms of which 1 ms to minimize.
[2023-03-13 07:46:20] [INFO ] Deduced a trap composed of 252 places in 653 ms of which 1 ms to minimize.
[2023-03-13 07:46:20] [INFO ] Deduced a trap composed of 230 places in 577 ms of which 1 ms to minimize.
[2023-03-13 07:46:21] [INFO ] Deduced a trap composed of 96 places in 607 ms of which 2 ms to minimize.
[2023-03-13 07:46:22] [INFO ] Deduced a trap composed of 273 places in 692 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 07:46:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:46:22] [INFO ] After 25172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA AutoFlight-PT-24b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 318 ms.
Support contains 56 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 824 transitions
Trivial Post-agglo rules discarded 824 transitions
Performed 824 trivial Post agglomeration. Transition count delta: 824
Iterating post reduction 0 with 824 rules applied. Total rules applied 824 place count 2230 transition count 1404
Reduce places removed 824 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 967 rules applied. Total rules applied 1791 place count 1406 transition count 1261
Reduce places removed 40 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 76 rules applied. Total rules applied 1867 place count 1366 transition count 1225
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 49 rules applied. Total rules applied 1916 place count 1330 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1917 place count 1329 transition count 1212
Performed 276 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 276 Pre rules applied. Total rules applied 1917 place count 1329 transition count 936
Deduced a syphon composed of 276 places in 5 ms
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 5 with 552 rules applied. Total rules applied 2469 place count 1053 transition count 936
Discarding 203 places :
Symmetric choice reduction at 5 with 203 rule applications. Total rules 2672 place count 850 transition count 733
Iterating global reduction 5 with 203 rules applied. Total rules applied 2875 place count 850 transition count 733
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 2875 place count 850 transition count 671
Deduced a syphon composed of 62 places in 7 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 2999 place count 788 transition count 671
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 1 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 5 with 368 rules applied. Total rules applied 3367 place count 604 transition count 487
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3371 place count 602 transition count 488
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3374 place count 602 transition count 485
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3376 place count 601 transition count 484
Free-agglomeration rule applied 82 times.
Iterating global reduction 5 with 82 rules applied. Total rules applied 3458 place count 601 transition count 402
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 3540 place count 519 transition count 402
Applied a total of 3540 rules in 484 ms. Remains 519 /2230 variables (removed 1711) and now considering 402/2228 (removed 1826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 519/2230 places, 402/2228 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :4
FORMULA AutoFlight-PT-24b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 402 rows 519 cols
[2023-03-13 07:46:23] [INFO ] Computed 148 place invariants in 4 ms
[2023-03-13 07:46:23] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 07:46:23] [INFO ] [Nat]Absence check using 146 positive place invariants in 24 ms returned sat
[2023-03-13 07:46:23] [INFO ] [Nat]Absence check using 146 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-13 07:46:23] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 07:46:23] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-13 07:46:24] [INFO ] After 140ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 07:46:24] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 1 ms to minimize.
[2023-03-13 07:46:24] [INFO ] Deduced a trap composed of 199 places in 135 ms of which 1 ms to minimize.
[2023-03-13 07:46:24] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 1 ms to minimize.
[2023-03-13 07:46:24] [INFO ] Deduced a trap composed of 138 places in 103 ms of which 1 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 0 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 13 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 194 places in 139 ms of which 1 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 148 places in 100 ms of which 1 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 153 places in 124 ms of which 0 ms to minimize.
[2023-03-13 07:46:25] [INFO ] Deduced a trap composed of 192 places in 105 ms of which 1 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 202 places in 150 ms of which 5 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 210 places in 97 ms of which 1 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 198 places in 121 ms of which 1 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 208 places in 99 ms of which 0 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 207 places in 112 ms of which 13 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 204 places in 120 ms of which 0 ms to minimize.
[2023-03-13 07:46:26] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 1 ms to minimize.
[2023-03-13 07:46:27] [INFO ] Deduced a trap composed of 156 places in 117 ms of which 0 ms to minimize.
[2023-03-13 07:46:27] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 0 ms to minimize.
[2023-03-13 07:46:27] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 1 ms to minimize.
[2023-03-13 07:46:27] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 0 ms to minimize.
[2023-03-13 07:46:27] [INFO ] Deduced a trap composed of 158 places in 289 ms of which 0 ms to minimize.
[2023-03-13 07:46:28] [INFO ] Deduced a trap composed of 152 places in 192 ms of which 1 ms to minimize.
[2023-03-13 07:46:28] [INFO ] Deduced a trap composed of 159 places in 114 ms of which 0 ms to minimize.
[2023-03-13 07:46:28] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 0 ms to minimize.
[2023-03-13 07:46:28] [INFO ] Deduced a trap composed of 160 places in 130 ms of which 0 ms to minimize.
[2023-03-13 07:46:28] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 13 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 139 places in 99 ms of which 0 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 206 places in 100 ms of which 1 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 146 places in 104 ms of which 0 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 1 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 158 places in 86 ms of which 0 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 14 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 218 places in 108 ms of which 1 ms to minimize.
[2023-03-13 07:46:29] [INFO ] Deduced a trap composed of 202 places in 135 ms of which 1 ms to minimize.
[2023-03-13 07:46:30] [INFO ] Deduced a trap composed of 210 places in 132 ms of which 1 ms to minimize.
[2023-03-13 07:46:30] [INFO ] Deduced a trap composed of 214 places in 151 ms of which 1 ms to minimize.
[2023-03-13 07:46:30] [INFO ] Deduced a trap composed of 206 places in 113 ms of which 0 ms to minimize.
[2023-03-13 07:46:30] [INFO ] Deduced a trap composed of 216 places in 160 ms of which 1 ms to minimize.
[2023-03-13 07:46:30] [INFO ] Deduced a trap composed of 218 places in 186 ms of which 1 ms to minimize.
[2023-03-13 07:46:31] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 0 ms to minimize.
[2023-03-13 07:46:31] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-13 07:46:31] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 7152 ms
[2023-03-13 07:46:31] [INFO ] Deduced a trap composed of 210 places in 204 ms of which 1 ms to minimize.
[2023-03-13 07:46:31] [INFO ] Deduced a trap composed of 221 places in 144 ms of which 1 ms to minimize.
[2023-03-13 07:46:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-13 07:46:31] [INFO ] After 7883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-13 07:46:31] [INFO ] After 8391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 22 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 402/402 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 519 transition count 386
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 503 transition count 386
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 503 transition count 375
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 492 transition count 375
Performed 22 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 98 place count 470 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 470 transition count 348
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 470 transition count 338
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 460 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 459 transition count 337
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 33 rules applied. Total rules applied 154 place count 431 transition count 332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 159 place count 426 transition count 332
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 159 place count 426 transition count 310
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 203 place count 404 transition count 310
Applied a total of 203 rules in 80 ms. Remains 404 /519 variables (removed 115) and now considering 310/402 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 404/519 places, 310/402 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 348461 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348461 steps, saw 83328 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 310 rows 404 cols
[2023-03-13 07:46:35] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-13 07:46:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 07:46:35] [INFO ] [Nat]Absence check using 118 positive place invariants in 19 ms returned sat
[2023-03-13 07:46:35] [INFO ] [Nat]Absence check using 118 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-13 07:46:35] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 07:46:35] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-13 07:46:35] [INFO ] After 118ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 07:46:35] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2023-03-13 07:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-13 07:46:36] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-13 07:46:36] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 22 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 310/310 transitions.
Applied a total of 0 rules in 9 ms. Remains 404 /404 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 404/404 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 310/310 transitions.
Applied a total of 0 rules in 22 ms. Remains 404 /404 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-13 07:46:36] [INFO ] Invariant cache hit.
[2023-03-13 07:46:36] [INFO ] Implicit Places using invariants in 523 ms returned [307, 311, 316, 321, 326, 330, 335, 347, 352, 357, 363, 372, 380, 384, 403]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 542 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 389/404 places, 310/310 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 376 transition count 297
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 376 transition count 297
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 363 transition count 284
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 363 transition count 270
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 80 place count 349 transition count 270
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 349 transition count 258
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 104 place count 337 transition count 258
Applied a total of 104 rules in 77 ms. Remains 337 /389 variables (removed 52) and now considering 258/310 (removed 52) transitions.
// Phase 1: matrix 258 rows 337 cols
[2023-03-13 07:46:36] [INFO ] Computed 105 place invariants in 2 ms
[2023-03-13 07:46:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-13 07:46:37] [INFO ] Invariant cache hit.
[2023-03-13 07:46:37] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-13 07:46:38] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned [1, 2, 3, 4, 5, 6, 10, 14, 18, 19, 21, 22, 24, 25, 27, 28, 30, 35, 36, 38, 39, 41, 42, 47, 54, 56, 57, 59, 60, 62, 66, 67, 69, 70, 74, 76, 77, 79, 80, 86]
Discarding 40 places :
Implicit Place search using SMT with State Equation took 1589 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 297/404 places, 258/310 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 297 transition count 176
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 215 transition count 176
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 164 place count 215 transition count 161
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 194 place count 200 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 205 place count 189 transition count 150
Iterating global reduction 2 with 11 rules applied. Total rules applied 216 place count 189 transition count 150
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 234 place count 180 transition count 141
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 366 edges and 180 vertex of which 178 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 6 rules applied. Total rules applied 240 place count 178 transition count 136
Applied a total of 240 rules in 13 ms. Remains 178 /297 variables (removed 119) and now considering 136/258 (removed 122) transitions.
// Phase 1: matrix 136 rows 178 cols
[2023-03-13 07:46:38] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-13 07:46:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-13 07:46:38] [INFO ] Invariant cache hit.
[2023-03-13 07:46:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 07:46:38] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [11, 18, 40, 41]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 378 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 174/404 places, 136/310 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 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 173 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 173 transition count 132
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 170 transition count 132
Applied a total of 8 rules in 7 ms. Remains 170 /174 variables (removed 4) and now considering 132/136 (removed 4) transitions.
// Phase 1: matrix 132 rows 170 cols
[2023-03-13 07:46:38] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-13 07:46:39] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-13 07:46:39] [INFO ] Invariant cache hit.
[2023-03-13 07:46:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-13 07:46:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 170/404 places, 132/310 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3062 ms. Remains : 170/404 places, 132/310 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-24b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 07:46:39] [INFO ] Invariant cache hit.
[2023-03-13 07:46:39] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:46:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 8 ms returned sat
[2023-03-13 07:46:39] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:46:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-13 07:46:39] [INFO ] After 9ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:46:39] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-13 07:46:39] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 132/132 transitions.
Graph (complete) has 352 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 169 transition count 125
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 163 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 162 transition count 124
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 15 place count 162 transition count 119
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 27 place count 155 transition count 119
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 155 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 154 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 39 place count 149 transition count 113
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 43 place count 149 transition count 109
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 48 place count 145 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 145 transition count 107
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 6 with 3 rules applied. Total rules applied 52 place count 142 transition count 105
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 57 place count 137 transition count 100
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1724.t1725.t1726.t1903.t292.t532.t2192.t293 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 7 with 34 rules applied. Total rules applied 91 place count 108 transition count 66
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 123 place count 76 transition count 66
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 123 place count 76 transition count 63
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 129 place count 73 transition count 63
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 137 place count 65 transition count 55
Iterating global reduction 9 with 8 rules applied. Total rules applied 145 place count 65 transition count 55
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 152 place count 58 transition count 48
Iterating global reduction 9 with 7 rules applied. Total rules applied 159 place count 58 transition count 48
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 166 place count 51 transition count 41
Iterating global reduction 9 with 7 rules applied. Total rules applied 173 place count 51 transition count 41
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 197 place count 36 transition count 32
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 62 edges and 36 vertex of which 22 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 8 rules applied. Total rules applied 205 place count 22 transition count 25
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 212 place count 22 transition count 18
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 215 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 39 edges and 18 vertex of which 16 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 221 place count 16 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 222 place count 16 transition count 13
Applied a total of 222 rules in 39 ms. Remains 16 /170 variables (removed 154) and now considering 13/132 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 16/170 places, 13/132 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA AutoFlight-PT-24b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 44497 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutoFlight_PT_24b
(NrP: 2230 NrTr: 2228 NrArc: 5186)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.337sec

net check time: 0m 0.000sec

init dd package: 0m 2.884sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9474840 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16100300 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.014sec

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-24b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutoFlight-PT-24b, 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 r010-oct2-167813599100495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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