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.r009-oct2-167813598000511.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 ltsminxred
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 r009-oct2-167813598000511
=====================================================================

--------------------
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 1678634724516

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:25:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:25:28] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2023-03-12 15:25:28] [INFO ] Transformed 3950 places.
[2023-03-12 15:25:28] [INFO ] Transformed 3936 transitions.
[2023-03-12 15:25:28] [INFO ] Found NUPN structural information;
[2023-03-12 15:25:28] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
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-02 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 60 ms. (steps per millisecond=166 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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
Running SMT prover for 6 properties.
// Phase 1: matrix 3936 rows 3950 cols
[2023-03-12 15:25:29] [INFO ] Computed 258 place invariants in 62 ms
[2023-03-12 15:25:31] [INFO ] After 1662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 15:25:32] [INFO ] [Nat]Absence check using 257 positive place invariants in 277 ms returned sat
[2023-03-12 15:25:32] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 15:25:38] [INFO ] After 5518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 15:25:44] [INFO ] Deduced a trap composed of 21 places in 4135 ms of which 19 ms to minimize.
[2023-03-12 15:25:47] [INFO ] Deduced a trap composed of 42 places in 2724 ms of which 17 ms to minimize.
[2023-03-12 15:25:49] [INFO ] Deduced a trap composed of 144 places in 1966 ms of which 16 ms to minimize.
[2023-03-12 15:25:51] [INFO ] Deduced a trap composed of 454 places in 1816 ms of which 8 ms to minimize.
[2023-03-12 15:25:53] [INFO ] Deduced a trap composed of 159 places in 1953 ms of which 5 ms to minimize.
[2023-03-12 15:25:55] [INFO ] Deduced a trap composed of 158 places in 1694 ms of which 2 ms to minimize.
[2023-03-12 15:25:57] [INFO ] Deduced a trap composed of 158 places in 1666 ms of which 3 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-12 15:25:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 15:25:57] [INFO ] After 26200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 488 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 13 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 8 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 1 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 5 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 953 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 954 ms. Remains : 836/3950 places, 650/3936 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 6) seen :2
FORMULA AutoFlight-PT-48b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 650 rows 836 cols
[2023-03-12 15:25:59] [INFO ] Computed 239 place invariants in 6 ms
[2023-03-12 15:25:59] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:25:59] [INFO ] [Nat]Absence check using 237 positive place invariants in 49 ms returned sat
[2023-03-12 15:25:59] [INFO ] [Nat]Absence check using 237 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-12 15:26:00] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:26:00] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-12 15:26:01] [INFO ] After 648ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:26:01] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-12 15:26:02] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-12 15:26:02] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2023-03-12 15:26:02] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 0 ms to minimize.
[2023-03-12 15:26:02] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-12 15:26:02] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 0 ms to minimize.
[2023-03-12 15:26:03] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 0 ms to minimize.
[2023-03-12 15:26:03] [INFO ] Deduced a trap composed of 302 places in 189 ms of which 1 ms to minimize.
[2023-03-12 15:26:03] [INFO ] Deduced a trap composed of 204 places in 183 ms of which 1 ms to minimize.
[2023-03-12 15:26:03] [INFO ] Deduced a trap composed of 294 places in 168 ms of which 0 ms to minimize.
[2023-03-12 15:26:04] [INFO ] Deduced a trap composed of 337 places in 168 ms of which 0 ms to minimize.
[2023-03-12 15:26:04] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-12 15:26:04] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 0 ms to minimize.
[2023-03-12 15:26:05] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2023-03-12 15:26:05] [INFO ] Deduced a trap composed of 285 places in 309 ms of which 1 ms to minimize.
[2023-03-12 15:26:05] [INFO ] Deduced a trap composed of 291 places in 244 ms of which 0 ms to minimize.
[2023-03-12 15:26:06] [INFO ] Deduced a trap composed of 288 places in 197 ms of which 0 ms to minimize.
[2023-03-12 15:26:06] [INFO ] Deduced a trap composed of 298 places in 228 ms of which 0 ms to minimize.
[2023-03-12 15:26:06] [INFO ] Deduced a trap composed of 287 places in 171 ms of which 1 ms to minimize.
[2023-03-12 15:26:06] [INFO ] Deduced a trap composed of 202 places in 214 ms of which 0 ms to minimize.
[2023-03-12 15:26:07] [INFO ] Deduced a trap composed of 299 places in 170 ms of which 0 ms to minimize.
[2023-03-12 15:26:07] [INFO ] Deduced a trap composed of 212 places in 287 ms of which 0 ms to minimize.
[2023-03-12 15:26:07] [INFO ] Deduced a trap composed of 281 places in 162 ms of which 1 ms to minimize.
[2023-03-12 15:26:07] [INFO ] Deduced a trap composed of 289 places in 205 ms of which 0 ms to minimize.
[2023-03-12 15:26:08] [INFO ] Deduced a trap composed of 336 places in 224 ms of which 1 ms to minimize.
[2023-03-12 15:26:08] [INFO ] Deduced a trap composed of 291 places in 206 ms of which 1 ms to minimize.
[2023-03-12 15:26:08] [INFO ] Deduced a trap composed of 291 places in 155 ms of which 1 ms to minimize.
[2023-03-12 15:26:09] [INFO ] Deduced a trap composed of 281 places in 228 ms of which 1 ms to minimize.
[2023-03-12 15:26:09] [INFO ] Deduced a trap composed of 297 places in 216 ms of which 1 ms to minimize.
[2023-03-12 15:26:09] [INFO ] Deduced a trap composed of 298 places in 226 ms of which 0 ms to minimize.
[2023-03-12 15:26:09] [INFO ] Deduced a trap composed of 297 places in 229 ms of which 1 ms to minimize.
[2023-03-12 15:26:10] [INFO ] Deduced a trap composed of 299 places in 197 ms of which 0 ms to minimize.
[2023-03-12 15:26:10] [INFO ] Deduced a trap composed of 297 places in 207 ms of which 1 ms to minimize.
[2023-03-12 15:26:10] [INFO ] Deduced a trap composed of 300 places in 203 ms of which 1 ms to minimize.
[2023-03-12 15:26:10] [INFO ] Deduced a trap composed of 306 places in 165 ms of which 0 ms to minimize.
[2023-03-12 15:26:11] [INFO ] Deduced a trap composed of 346 places in 234 ms of which 13 ms to minimize.
[2023-03-12 15:26:11] [INFO ] Deduced a trap composed of 347 places in 327 ms of which 1 ms to minimize.
[2023-03-12 15:26:11] [INFO ] Deduced a trap composed of 349 places in 230 ms of which 1 ms to minimize.
[2023-03-12 15:26:12] [INFO ] Deduced a trap composed of 355 places in 223 ms of which 1 ms to minimize.
[2023-03-12 15:26:12] [INFO ] Deduced a trap composed of 351 places in 161 ms of which 0 ms to minimize.
[2023-03-12 15:26:12] [INFO ] Deduced a trap composed of 355 places in 154 ms of which 0 ms to minimize.
[2023-03-12 15:26:12] [INFO ] Deduced a trap composed of 355 places in 141 ms of which 1 ms to minimize.
[2023-03-12 15:26:13] [INFO ] Deduced a trap composed of 353 places in 233 ms of which 1 ms to minimize.
[2023-03-12 15:26:13] [INFO ] Deduced a trap composed of 357 places in 236 ms of which 1 ms to minimize.
[2023-03-12 15:26:13] [INFO ] Deduced a trap composed of 357 places in 171 ms of which 1 ms to minimize.
[2023-03-12 15:26:13] [INFO ] Deduced a trap composed of 361 places in 227 ms of which 1 ms to minimize.
[2023-03-12 15:26:14] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 12480 ms
[2023-03-12 15:26:14] [INFO ] Deduced a trap composed of 279 places in 351 ms of which 0 ms to minimize.
[2023-03-12 15:26:14] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-12 15:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2023-03-12 15:26:15] [INFO ] Deduced a trap composed of 294 places in 247 ms of which 18 ms to minimize.
[2023-03-12 15:26:15] [INFO ] Deduced a trap composed of 311 places in 258 ms of which 2 ms to minimize.
[2023-03-12 15:26:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 658 ms
[2023-03-12 15:26:15] [INFO ] After 15124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 864 ms.
[2023-03-12 15:26:16] [INFO ] After 17021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA AutoFlight-PT-48b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 144 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 0 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 1 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 143 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 143 ms. Remains : 765/836 places, 582/650 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 200844 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{2=1}
Probabilistic random walk after 200844 steps, saw 60851 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 582 rows 765 cols
[2023-03-12 15:26:20] [INFO ] Computed 237 place invariants in 19 ms
[2023-03-12 15:26:20] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:26:20] [INFO ] [Nat]Absence check using 235 positive place invariants in 56 ms returned sat
[2023-03-12 15:26:20] [INFO ] [Nat]Absence check using 235 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 15:26:21] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:21] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-12 15:26:22] [INFO ] After 413ms SMT Verify possible using 323 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:22] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-12 15:26:22] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-12 15:26:23] [INFO ] Deduced a trap composed of 251 places in 620 ms of which 1 ms to minimize.
[2023-03-12 15:26:23] [INFO ] Deduced a trap composed of 275 places in 196 ms of which 1 ms to minimize.
[2023-03-12 15:26:23] [INFO ] Deduced a trap composed of 255 places in 210 ms of which 0 ms to minimize.
[2023-03-12 15:26:24] [INFO ] Deduced a trap composed of 267 places in 200 ms of which 0 ms to minimize.
[2023-03-12 15:26:24] [INFO ] Deduced a trap composed of 259 places in 180 ms of which 1 ms to minimize.
[2023-03-12 15:26:24] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-12 15:26:24] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-12 15:26:25] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2023-03-12 15:26:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3100 ms
[2023-03-12 15:26:25] [INFO ] After 3899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-12 15:26:26] [INFO ] After 5693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 43 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 1 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 1 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 755 transition count 573
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 755 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 753 transition count 571
Applied a total of 23 rules in 86 ms. Remains 753 /765 variables (removed 12) and now considering 571/582 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 753/765 places, 571/582 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189662 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189662 steps, saw 59271 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 571 rows 753 cols
[2023-03-12 15:26:29] [INFO ] Computed 236 place invariants in 8 ms
[2023-03-12 15:26:29] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:26:29] [INFO ] [Nat]Absence check using 234 positive place invariants in 41 ms returned sat
[2023-03-12 15:26:29] [INFO ] [Nat]Absence check using 234 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-12 15:26:30] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-12 15:26:31] [INFO ] After 682ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:31] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2023-03-12 15:26:31] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 0 ms to minimize.
[2023-03-12 15:26:32] [INFO ] Deduced a trap composed of 296 places in 240 ms of which 1 ms to minimize.
[2023-03-12 15:26:32] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2023-03-12 15:26:32] [INFO ] Deduced a trap composed of 297 places in 265 ms of which 1 ms to minimize.
[2023-03-12 15:26:33] [INFO ] Deduced a trap composed of 299 places in 238 ms of which 1 ms to minimize.
[2023-03-12 15:26:33] [INFO ] Deduced a trap composed of 293 places in 201 ms of which 1 ms to minimize.
[2023-03-12 15:26:33] [INFO ] Deduced a trap composed of 295 places in 223 ms of which 1 ms to minimize.
[2023-03-12 15:26:33] [INFO ] Deduced a trap composed of 289 places in 185 ms of which 1 ms to minimize.
[2023-03-12 15:26:34] [INFO ] Deduced a trap composed of 294 places in 188 ms of which 0 ms to minimize.
[2023-03-12 15:26:34] [INFO ] Deduced a trap composed of 300 places in 182 ms of which 1 ms to minimize.
[2023-03-12 15:26:34] [INFO ] Deduced a trap composed of 293 places in 189 ms of which 1 ms to minimize.
[2023-03-12 15:26:35] [INFO ] Deduced a trap composed of 304 places in 559 ms of which 1 ms to minimize.
[2023-03-12 15:26:35] [INFO ] Deduced a trap composed of 299 places in 375 ms of which 0 ms to minimize.
[2023-03-12 15:26:36] [INFO ] Deduced a trap composed of 301 places in 193 ms of which 1 ms to minimize.
[2023-03-12 15:26:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4746 ms
[2023-03-12 15:26:36] [INFO ] After 5782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 511 ms.
[2023-03-12 15:26:36] [INFO ] After 7005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 43 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 571/571 transitions.
Applied a total of 0 rules in 31 ms. Remains 753 /753 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 753/753 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 571/571 transitions.
Applied a total of 0 rules in 27 ms. Remains 753 /753 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-12 15:26:36] [INFO ] Invariant cache hit.
[2023-03-12 15:26:38] [INFO ] Implicit Places using invariants in 1250 ms returned [581, 595, 601, 607, 613, 619, 633, 639, 645, 651, 655, 659, 663, 667, 671, 674, 676, 683, 685, 687, 690, 695, 700, 709, 710, 715, 720, 725, 734, 735, 740, 745]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1274 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 721/753 places, 571/571 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 690 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 690 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 690 transition count 538
Applied a total of 64 rules in 87 ms. Remains 690 /721 variables (removed 31) and now considering 538/571 (removed 33) transitions.
// Phase 1: matrix 538 rows 690 cols
[2023-03-12 15:26:38] [INFO ] Computed 204 place invariants in 7 ms
[2023-03-12 15:26:39] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-12 15:26:39] [INFO ] Invariant cache hit.
[2023-03-12 15:26:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-12 15:26:43] [INFO ] Implicit Places using invariants and state equation in 3991 ms returned [6, 8, 9, 13, 15, 20, 27, 29, 30, 32, 36, 37, 39, 40, 42, 43, 47, 48, 54, 56, 57, 59, 60, 62, 72, 75, 76, 78, 83, 84, 86, 87, 89, 90, 92, 98, 100, 101, 103, 104, 106, 107, 109, 110, 112, 113, 115, 116, 118, 119, 121, 125, 130, 131, 140, 186, 191, 206, 217]
Discarding 59 places :
Implicit Place search using SMT with State Equation took 5036 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 631/753 places, 538/571 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 631 transition count 428
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 521 transition count 428
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 220 place count 521 transition count 382
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 312 place count 475 transition count 382
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 325 place count 462 transition count 369
Iterating global reduction 2 with 13 rules applied. Total rules applied 338 place count 462 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 461 transition count 368
Applied a total of 340 rules in 52 ms. Remains 461 /631 variables (removed 170) and now considering 368/538 (removed 170) transitions.
// Phase 1: matrix 368 rows 461 cols
[2023-03-12 15:26:43] [INFO ] Computed 145 place invariants in 2 ms
[2023-03-12 15:26:43] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-12 15:26:43] [INFO ] Invariant cache hit.
[2023-03-12 15:26:43] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-12 15:26:45] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 461/753 places, 368/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8301 ms. Remains : 461/753 places, 368/571 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 356104 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356104 steps, saw 94999 distinct states, run finished after 3013 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:26:48] [INFO ] Invariant cache hit.
[2023-03-12 15:26:48] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:26:48] [INFO ] [Nat]Absence check using 145 positive place invariants in 152 ms returned sat
[2023-03-12 15:26:48] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:48] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-12 15:26:49] [INFO ] After 203ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:49] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 1 ms to minimize.
[2023-03-12 15:26:49] [INFO ] Deduced a trap composed of 175 places in 266 ms of which 24 ms to minimize.
[2023-03-12 15:26:49] [INFO ] Deduced a trap composed of 176 places in 252 ms of which 0 ms to minimize.
[2023-03-12 15:26:50] [INFO ] Deduced a trap composed of 173 places in 103 ms of which 0 ms to minimize.
[2023-03-12 15:26:50] [INFO ] Deduced a trap composed of 8 places in 458 ms of which 1 ms to minimize.
[2023-03-12 15:26:50] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 0 ms to minimize.
[2023-03-12 15:26:50] [INFO ] Deduced a trap composed of 185 places in 134 ms of which 1 ms to minimize.
[2023-03-12 15:26:51] [INFO ] Deduced a trap composed of 185 places in 237 ms of which 1 ms to minimize.
[2023-03-12 15:26:51] [INFO ] Deduced a trap composed of 187 places in 179 ms of which 1 ms to minimize.
[2023-03-12 15:26:51] [INFO ] Deduced a trap composed of 188 places in 166 ms of which 0 ms to minimize.
[2023-03-12 15:26:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2385 ms
[2023-03-12 15:26:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2023-03-12 15:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-12 15:26:51] [INFO ] After 2869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-12 15:26:51] [INFO ] After 3555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 ms.
Support contains 43 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 368/368 transitions.
Applied a total of 0 rules in 14 ms. Remains 461 /461 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 461/461 places, 368/368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 368/368 transitions.
Applied a total of 0 rules in 38 ms. Remains 461 /461 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-12 15:26:52] [INFO ] Invariant cache hit.
[2023-03-12 15:26:52] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-12 15:26:52] [INFO ] Invariant cache hit.
[2023-03-12 15:26:53] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-12 15:26:54] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2023-03-12 15:26:54] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 15:26:54] [INFO ] Invariant cache hit.
[2023-03-12 15:26:54] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2740 ms. Remains : 461/461 places, 368/368 transitions.
Graph (complete) has 729 edges and 461 vertex of which 358 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.2 ms
Discarding 103 places :
Also discarding 0 output transitions
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 358 transition count 322
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 312 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 311 transition count 321
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 95 place count 311 transition count 267
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 203 place count 257 transition count 267
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 222 place count 238 transition count 248
Iterating global reduction 3 with 19 rules applied. Total rules applied 241 place count 238 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 238 transition count 246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 237 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 237 transition count 244
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 237 transition count 243
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 261 place count 237 transition count 229
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 275 place count 223 transition count 229
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 316 place count 223 transition count 229
Applied a total of 316 rules in 39 ms. Remains 223 /461 variables (removed 238) and now considering 229/368 (removed 139) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 229 rows 223 cols
[2023-03-12 15:26:54] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-12 15:26:54] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:26:55] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2023-03-12 15:26:55] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:55] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-12 15:26:55] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:26:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-12 15:26:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 461 places, 368 transitions and 1471 arcs took 2 ms.
[2023-03-12 15:26:55] [INFO ] Flatten gal took : 103 ms
Total runtime 87816 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/837/inv_0_ --invariant=/tmp/837/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12587264 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097584 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
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r009-oct2-167813598000511"
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 ;