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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:10 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.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 266K 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-12b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678631548501

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-12b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:32:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:32:32] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-12 14:32:32] [INFO ] Transformed 1126 places.
[2023-03-12 14:32:32] [INFO ] Transformed 1124 transitions.
[2023-03-12 14:32:32] [INFO ] Found NUPN structural information;
[2023-03-12 14:32:32] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-12 14:32:34] [INFO ] Computed 76 place invariants in 27 ms
[2023-03-12 14:32:35] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 14:32:35] [INFO ] [Nat]Absence check using 75 positive place invariants in 193 ms returned sat
[2023-03-12 14:32:35] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:32:40] [INFO ] After 4644ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-12 14:32:41] [INFO ] Deduced a trap composed of 38 places in 718 ms of which 6 ms to minimize.
[2023-03-12 14:32:42] [INFO ] Deduced a trap composed of 65 places in 902 ms of which 2 ms to minimize.
[2023-03-12 14:32:43] [INFO ] Deduced a trap composed of 24 places in 805 ms of which 3 ms to minimize.
[2023-03-12 14:32:44] [INFO ] Deduced a trap composed of 29 places in 648 ms of which 53 ms to minimize.
[2023-03-12 14:32:44] [INFO ] Deduced a trap composed of 15 places in 531 ms of which 13 ms to minimize.
[2023-03-12 14:32:45] [INFO ] Deduced a trap composed of 18 places in 609 ms of which 1 ms to minimize.
[2023-03-12 14:32:46] [INFO ] Deduced a trap composed of 31 places in 873 ms of which 1 ms to minimize.
[2023-03-12 14:32:46] [INFO ] Deduced a trap composed of 77 places in 347 ms of which 2 ms to minimize.
[2023-03-12 14:32:47] [INFO ] Deduced a trap composed of 67 places in 389 ms of which 1 ms to minimize.
[2023-03-12 14:32:47] [INFO ] Deduced a trap composed of 126 places in 434 ms of which 1 ms to minimize.
[2023-03-12 14:32:48] [INFO ] Deduced a trap composed of 60 places in 297 ms of which 1 ms to minimize.
[2023-03-12 14:32:48] [INFO ] Deduced a trap composed of 61 places in 300 ms of which 1 ms to minimize.
[2023-03-12 14:32:48] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 1 ms to minimize.
[2023-03-12 14:32:49] [INFO ] Deduced a trap composed of 122 places in 502 ms of which 1 ms to minimize.
[2023-03-12 14:32:50] [INFO ] Deduced a trap composed of 79 places in 675 ms of which 1 ms to minimize.
[2023-03-12 14:32:50] [INFO ] Deduced a trap composed of 85 places in 388 ms of which 1 ms to minimize.
[2023-03-12 14:32:50] [INFO ] Deduced a trap composed of 94 places in 308 ms of which 1 ms to minimize.
[2023-03-12 14:32:51] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 3 ms to minimize.
[2023-03-12 14:32:51] [INFO ] Deduced a trap composed of 131 places in 507 ms of which 27 ms to minimize.
[2023-03-12 14:32:52] [INFO ] Deduced a trap composed of 136 places in 435 ms of which 1 ms to minimize.
[2023-03-12 14:32:52] [INFO ] Deduced a trap composed of 83 places in 384 ms of which 1 ms to minimize.
[2023-03-12 14:32:53] [INFO ] Deduced a trap composed of 77 places in 298 ms of which 1 ms to minimize.
[2023-03-12 14:32:54] [INFO ] Deduced a trap composed of 32 places in 1691 ms of which 1 ms to minimize.
[2023-03-12 14:32:55] [INFO ] Deduced a trap composed of 92 places in 623 ms of which 1 ms to minimize.
[2023-03-12 14:32:57] [INFO ] Deduced a trap composed of 107 places in 1535 ms of which 1 ms to minimize.
[2023-03-12 14:32:59] [INFO ] Deduced a trap composed of 68 places in 2549 ms of which 1 ms to minimize.
[2023-03-12 14:32:59] [INFO ] Deduced a trap composed of 81 places in 267 ms of which 1 ms to minimize.
[2023-03-12 14:33:00] [INFO ] Deduced a trap composed of 132 places in 255 ms of which 0 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 14:33:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:33:00] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 354 ms.
Support contains 55 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 1126 transition count 738
Reduce places removed 386 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 451 rules applied. Total rules applied 837 place count 740 transition count 673
Reduce places removed 17 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 36 rules applied. Total rules applied 873 place count 723 transition count 654
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 24 rules applied. Total rules applied 897 place count 704 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 898 place count 703 transition count 649
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 134 Pre rules applied. Total rules applied 898 place count 703 transition count 515
Deduced a syphon composed of 134 places in 2 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 5 with 268 rules applied. Total rules applied 1166 place count 569 transition count 515
Discarding 92 places :
Symmetric choice reduction at 5 with 92 rule applications. Total rules 1258 place count 477 transition count 423
Iterating global reduction 5 with 92 rules applied. Total rules applied 1350 place count 477 transition count 423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1353 place count 477 transition count 420
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1353 place count 477 transition count 395
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1403 place count 452 transition count 395
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 1611 place count 348 transition count 291
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 6 with 2 rules applied. Total rules applied 1613 place count 347 transition count 291
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1617 place count 347 transition count 287
Free-agglomeration rule applied 44 times.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1661 place count 347 transition count 243
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 6 with 44 rules applied. Total rules applied 1705 place count 303 transition count 243
Applied a total of 1705 rules in 206 ms. Remains 303 /1126 variables (removed 823) and now considering 243/1124 (removed 881) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 303/1126 places, 243/1124 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :5
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 243 rows 303 cols
[2023-03-12 14:33:01] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 14:33:01] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:33:01] [INFO ] [Nat]Absence check using 74 positive place invariants in 53 ms returned sat
[2023-03-12 14:33:01] [INFO ] [Nat]Absence check using 74 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-12 14:33:01] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:33:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:33:01] [INFO ] After 103ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:33:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-12 14:33:01] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 7 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 96 places in 235 ms of which 31 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 0 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 14 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 0 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 1 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 0 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 85 places in 403 ms of which 5 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 0 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 14 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 103 places in 266 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 0 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 0 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 0 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 1 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 1 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 1 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5072 ms
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 10 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 4 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 1 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 99 places in 247 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 14 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 5 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 0 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 0 ms to minimize.
[2023-03-12 14:33:09] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 0 ms to minimize.
[2023-03-12 14:33:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2303 ms
[2023-03-12 14:33:09] [INFO ] After 7541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 14:33:09] [INFO ] After 8055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 40 ms.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 243/243 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 303 transition count 215
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 275 transition count 215
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 56 place count 275 transition count 203
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 80 place count 263 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 261 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 261 transition count 201
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 158 place count 224 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 224 transition count 162
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 166 place count 224 transition count 155
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 173 place count 217 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 216 transition count 154
Reduce places removed 54 places and 0 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 4 with 145 rules applied. Total rules applied 319 place count 162 transition count 63
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 92 rules applied. Total rules applied 411 place count 71 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 412 place count 70 transition count 62
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 412 place count 70 transition count 42
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 452 place count 50 transition count 42
Applied a total of 452 rules in 74 ms. Remains 50 /303 variables (removed 253) and now considering 42/243 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 50/303 places, 42/243 transitions.
Finished random walk after 125 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=125 )
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36834 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/715/inv_0_ --invariant=/tmp/715/inv_1_ --invariant=/tmp/715/inv_2_ --invariant=/tmp/715/inv_3_ --invariant=/tmp/715/inv_4_ --invariant=/tmp/715/inv_5_ --invariant=/tmp/715/inv_6_ --invariant=/tmp/715/inv_7_ --invariant=/tmp/715/inv_8_ --invariant=/tmp/715/inv_9_ --invariant=/tmp/715/inv_10_ --invariant=/tmp/715/inv_11_ --invariant=/tmp/715/inv_12_ --invariant=/tmp/715/inv_13_ --invariant=/tmp/715/inv_14_ --invariant=/tmp/715/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12578060 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099428 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 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-12b"
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-12b, 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-167813598000478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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