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-167813598000526.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-96b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 9.0K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:06 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 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:07 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 1.9M 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-96b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678635621772

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:40:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:40:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:40:25] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2023-03-12 15:40:25] [INFO ] Transformed 7894 places.
[2023-03-12 15:40:25] [INFO ] Transformed 7868 transitions.
[2023-03-12 15:40:25] [INFO ] Found NUPN structural information;
[2023-03-12 15:40:25] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 805 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 14) seen :3
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 7868 rows 7894 cols
[2023-03-12 15:40:27] [INFO ] Computed 514 place invariants in 287 ms
[2023-03-12 15:40:30] [INFO ] After 3320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 15:40:35] [INFO ] [Nat]Absence check using 513 positive place invariants in 1384 ms returned sat
[2023-03-12 15:40:35] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-12 15:40:55] [INFO ] After 18914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 15:40:55] [INFO ] After 18924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 15:40:55] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 5 different solutions.
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 922 ms.
Support contains 124 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions removed 3252 transitions
Trivial Post-agglo rules discarded 3252 transitions
Performed 3252 trivial Post agglomeration. Transition count delta: 3252
Iterating post reduction 0 with 3252 rules applied. Total rules applied 3252 place count 7894 transition count 4616
Reduce places removed 3252 places and 0 transitions.
Ensure Unique test removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 1 with 3774 rules applied. Total rules applied 7026 place count 4642 transition count 4094
Reduce places removed 167 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 2 with 215 rules applied. Total rules applied 7241 place count 4475 transition count 4046
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 7291 place count 4427 transition count 4044
Performed 986 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 986 Pre rules applied. Total rules applied 7291 place count 4427 transition count 3058
Deduced a syphon composed of 986 places in 35 ms
Reduce places removed 986 places and 0 transitions.
Iterating global reduction 4 with 1972 rules applied. Total rules applied 9263 place count 3441 transition count 3058
Discarding 658 places :
Symmetric choice reduction at 4 with 658 rule applications. Total rules 9921 place count 2783 transition count 2400
Iterating global reduction 4 with 658 rules applied. Total rules applied 10579 place count 2783 transition count 2400
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 8 rules applied. Total rules applied 10587 place count 2783 transition count 2392
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 10590 place count 2780 transition count 2392
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 209 Pre rules applied. Total rules applied 10590 place count 2780 transition count 2183
Deduced a syphon composed of 209 places in 20 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 6 with 418 rules applied. Total rules applied 11008 place count 2571 transition count 2183
Performed 623 Post agglomeration using F-continuation condition.Transition count delta: 623
Deduced a syphon composed of 623 places in 10 ms
Reduce places removed 623 places and 0 transitions.
Iterating global reduction 6 with 1246 rules applied. Total rules applied 12254 place count 1948 transition count 1560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 12258 place count 1946 transition count 1560
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 12278 place count 1946 transition count 1540
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 12286 place count 1942 transition count 1536
Free-agglomeration rule applied 278 times.
Iterating global reduction 6 with 278 rules applied. Total rules applied 12564 place count 1942 transition count 1258
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 6 with 278 rules applied. Total rules applied 12842 place count 1664 transition count 1258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 12843 place count 1663 transition count 1257
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 12854 place count 1652 transition count 1257
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 12854 place count 1652 transition count 1246
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 12876 place count 1641 transition count 1246
Applied a total of 12876 rules in 2226 ms. Remains 1641 /7894 variables (removed 6253) and now considering 1246/7868 (removed 6622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2228 ms. Remains : 1641/7894 places, 1246/7868 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 9) seen :7
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1246 rows 1641 cols
[2023-03-12 15:40:59] [INFO ] Computed 503 place invariants in 23 ms
[2023-03-12 15:40:59] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:41:00] [INFO ] [Nat]Absence check using 501 positive place invariants in 205 ms returned sat
[2023-03-12 15:41:00] [INFO ] [Nat]Absence check using 501 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-12 15:41:02] [INFO ] After 1390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:41:02] [INFO ] State equation strengthened by 684 read => feed constraints.
[2023-03-12 15:41:03] [INFO ] After 1027ms SMT Verify possible using 684 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:41:04] [INFO ] Deduced a trap composed of 10 places in 637 ms of which 36 ms to minimize.
[2023-03-12 15:41:04] [INFO ] Deduced a trap composed of 662 places in 452 ms of which 2 ms to minimize.
[2023-03-12 15:41:05] [INFO ] Deduced a trap composed of 662 places in 383 ms of which 2 ms to minimize.
[2023-03-12 15:41:05] [INFO ] Deduced a trap composed of 649 places in 424 ms of which 1 ms to minimize.
[2023-03-12 15:41:06] [INFO ] Deduced a trap composed of 651 places in 647 ms of which 2 ms to minimize.
[2023-03-12 15:41:07] [INFO ] Deduced a trap composed of 659 places in 534 ms of which 2 ms to minimize.
[2023-03-12 15:41:07] [INFO ] Deduced a trap composed of 652 places in 552 ms of which 14 ms to minimize.
[2023-03-12 15:41:08] [INFO ] Deduced a trap composed of 600 places in 428 ms of which 1 ms to minimize.
[2023-03-12 15:41:08] [INFO ] Deduced a trap composed of 662 places in 521 ms of which 1 ms to minimize.
[2023-03-12 15:41:09] [INFO ] Deduced a trap composed of 661 places in 441 ms of which 1 ms to minimize.
[2023-03-12 15:41:09] [INFO ] Deduced a trap composed of 645 places in 374 ms of which 1 ms to minimize.
[2023-03-12 15:41:10] [INFO ] Deduced a trap composed of 664 places in 347 ms of which 14 ms to minimize.
[2023-03-12 15:41:10] [INFO ] Deduced a trap composed of 678 places in 373 ms of which 1 ms to minimize.
[2023-03-12 15:41:11] [INFO ] Deduced a trap composed of 634 places in 324 ms of which 1 ms to minimize.
[2023-03-12 15:41:11] [INFO ] Deduced a trap composed of 651 places in 362 ms of which 1 ms to minimize.
[2023-03-12 15:41:11] [INFO ] Deduced a trap composed of 653 places in 377 ms of which 1 ms to minimize.
[2023-03-12 15:41:12] [INFO ] Deduced a trap composed of 661 places in 395 ms of which 1 ms to minimize.
[2023-03-12 15:41:12] [INFO ] Deduced a trap composed of 659 places in 418 ms of which 0 ms to minimize.
[2023-03-12 15:41:13] [INFO ] Deduced a trap composed of 645 places in 336 ms of which 0 ms to minimize.
[2023-03-12 15:41:13] [INFO ] Deduced a trap composed of 658 places in 356 ms of which 20 ms to minimize.
[2023-03-12 15:41:14] [INFO ] Deduced a trap composed of 655 places in 463 ms of which 1 ms to minimize.
[2023-03-12 15:41:14] [INFO ] Deduced a trap composed of 646 places in 432 ms of which 13 ms to minimize.
[2023-03-12 15:41:15] [INFO ] Deduced a trap composed of 644 places in 415 ms of which 0 ms to minimize.
[2023-03-12 15:41:15] [INFO ] Deduced a trap composed of 654 places in 411 ms of which 1 ms to minimize.
[2023-03-12 15:41:16] [INFO ] Deduced a trap composed of 651 places in 362 ms of which 1 ms to minimize.
[2023-03-12 15:41:16] [INFO ] Deduced a trap composed of 637 places in 417 ms of which 1 ms to minimize.
[2023-03-12 15:41:17] [INFO ] Deduced a trap composed of 661 places in 338 ms of which 1 ms to minimize.
[2023-03-12 15:41:17] [INFO ] Deduced a trap composed of 668 places in 346 ms of which 1 ms to minimize.
[2023-03-12 15:41:17] [INFO ] Deduced a trap composed of 654 places in 345 ms of which 1 ms to minimize.
[2023-03-12 15:41:18] [INFO ] Deduced a trap composed of 660 places in 473 ms of which 0 ms to minimize.
[2023-03-12 15:41:18] [INFO ] Deduced a trap composed of 646 places in 323 ms of which 1 ms to minimize.
[2023-03-12 15:41:19] [INFO ] Deduced a trap composed of 656 places in 350 ms of which 0 ms to minimize.
[2023-03-12 15:41:19] [INFO ] Deduced a trap composed of 656 places in 377 ms of which 1 ms to minimize.
[2023-03-12 15:41:20] [INFO ] Deduced a trap composed of 656 places in 360 ms of which 19 ms to minimize.
[2023-03-12 15:41:20] [INFO ] Deduced a trap composed of 622 places in 347 ms of which 1 ms to minimize.
[2023-03-12 15:41:20] [INFO ] Deduced a trap composed of 646 places in 363 ms of which 1 ms to minimize.
[2023-03-12 15:41:21] [INFO ] Deduced a trap composed of 660 places in 381 ms of which 7 ms to minimize.
[2023-03-12 15:41:21] [INFO ] Deduced a trap composed of 666 places in 386 ms of which 1 ms to minimize.
[2023-03-12 15:41:22] [INFO ] Deduced a trap composed of 618 places in 304 ms of which 1 ms to minimize.
[2023-03-12 15:41:22] [INFO ] Deduced a trap composed of 659 places in 367 ms of which 13 ms to minimize.
[2023-03-12 15:41:23] [INFO ] Deduced a trap composed of 654 places in 402 ms of which 1 ms to minimize.
[2023-03-12 15:41:23] [INFO ] Deduced a trap composed of 636 places in 370 ms of which 1 ms to minimize.
[2023-03-12 15:41:24] [INFO ] Deduced a trap composed of 615 places in 372 ms of which 1 ms to minimize.
[2023-03-12 15:41:24] [INFO ] Deduced a trap composed of 654 places in 339 ms of which 1 ms to minimize.
[2023-03-12 15:41:24] [INFO ] Deduced a trap composed of 655 places in 374 ms of which 15 ms to minimize.
[2023-03-12 15:41:25] [INFO ] Deduced a trap composed of 3 places in 877 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:41:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 15:41:25] [INFO ] After 25895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
Support contains 30 out of 1641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1641/1641 places, 1246/1246 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 1641 transition count 1195
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 1590 transition count 1194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 1589 transition count 1194
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 104 place count 1589 transition count 1169
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 155 place count 1563 transition count 1169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 1563 transition count 1168
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 157 place count 1562 transition count 1168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 1560 transition count 1166
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 1560 transition count 1166
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 267 place count 1506 transition count 1113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 270 place count 1506 transition count 1110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 270 place count 1506 transition count 1108
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 274 place count 1504 transition count 1108
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 286 place count 1504 transition count 1096
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 298 place count 1492 transition count 1096
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 1492 transition count 1096
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 302 place count 1490 transition count 1094
Iterating global reduction 5 with 2 rules applied. Total rules applied 304 place count 1490 transition count 1094
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 306 place count 1488 transition count 1092
Reduce places removed 46 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 5 with 51 rules applied. Total rules applied 357 place count 1442 transition count 1087
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 362 place count 1437 transition count 1087
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 41 Pre rules applied. Total rules applied 362 place count 1437 transition count 1046
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 444 place count 1396 transition count 1046
Applied a total of 444 rules in 682 ms. Remains 1396 /1641 variables (removed 245) and now considering 1046/1246 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 1396/1641 places, 1046/1246 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95545 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95545 steps, saw 44076 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1396 cols
[2023-03-12 15:41:29] [INFO ] Computed 454 place invariants in 8 ms
[2023-03-12 15:41:29] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:41:30] [INFO ] [Nat]Absence check using 452 positive place invariants in 125 ms returned sat
[2023-03-12 15:41:30] [INFO ] [Nat]Absence check using 452 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-12 15:41:30] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:41:30] [INFO ] State equation strengthened by 691 read => feed constraints.
[2023-03-12 15:41:31] [INFO ] After 597ms SMT Verify possible using 691 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:41:31] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-12 15:41:31] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-12 15:41:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-03-12 15:41:31] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-12 15:41:32] [INFO ] After 2273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 67685 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/647/inv_0_ --invariant=/tmp/647/inv_1_ --invariant=/tmp/647/inv_2_ --invariant=/tmp/647/inv_3_ --invariant=/tmp/647/inv_4_ --invariant=/tmp/647/inv_5_ --invariant=/tmp/647/inv_6_ --invariant=/tmp/647/inv_7_ --invariant=/tmp/647/inv_8_ --invariant=/tmp/647/inv_9_ --invariant=/tmp/647/inv_10_ --invariant=/tmp/647/inv_11_ --invariant=/tmp/647/inv_12_ --invariant=/tmp/647/inv_13_ --invariant=/tmp/647/inv_14_ --invariant=/tmp/647/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 153240 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16246096 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-96b"
export BK_EXAMINATION="ReachabilityCardinality"
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-96b, examination is ReachabilityCardinality"
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-167813598000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-96b.tgz
mv AutoFlight-PT-96b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;