Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813599100478.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100478
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:26:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:26:30] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-13 07:26:30] [INFO ] Transformed 1126 places.
[2023-03-13 07:26:30] [INFO ] Transformed 1124 transitions.
[2023-03-13 07:26:30] [INFO ] Found NUPN structural information;
[2023-03-13 07:26:30] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 653 ms. (steps per millisecond=15 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
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 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-13 07:26:31] [INFO ] Computed 76 place invariants in 32 ms
[2023-03-13 07:26:32] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 07:26:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 32 ms returned sat
[2023-03-13 07:26:33] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:26:35] [INFO ] After 1911ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-13 07:26:36] [INFO ] Deduced a trap composed of 38 places in 627 ms of which 34 ms to minimize.
[2023-03-13 07:26:36] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 1 ms to minimize.
[2023-03-13 07:26:37] [INFO ] Deduced a trap composed of 24 places in 577 ms of which 3 ms to minimize.
[2023-03-13 07:26:38] [INFO ] Deduced a trap composed of 29 places in 766 ms of which 2 ms to minimize.
[2023-03-13 07:26:38] [INFO ] Deduced a trap composed of 15 places in 663 ms of which 1 ms to minimize.
[2023-03-13 07:26:39] [INFO ] Deduced a trap composed of 18 places in 450 ms of which 0 ms to minimize.
[2023-03-13 07:26:39] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2023-03-13 07:26:40] [INFO ] Deduced a trap composed of 77 places in 426 ms of which 1 ms to minimize.
[2023-03-13 07:26:40] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 14 ms to minimize.
[2023-03-13 07:26:41] [INFO ] Deduced a trap composed of 126 places in 654 ms of which 1 ms to minimize.
[2023-03-13 07:26:41] [INFO ] Deduced a trap composed of 60 places in 606 ms of which 1 ms to minimize.
[2023-03-13 07:26:42] [INFO ] Deduced a trap composed of 61 places in 656 ms of which 1 ms to minimize.
[2023-03-13 07:26:43] [INFO ] Deduced a trap composed of 62 places in 626 ms of which 1 ms to minimize.
[2023-03-13 07:26:43] [INFO ] Deduced a trap composed of 122 places in 514 ms of which 0 ms to minimize.
[2023-03-13 07:26:44] [INFO ] Deduced a trap composed of 79 places in 390 ms of which 1 ms to minimize.
[2023-03-13 07:26:44] [INFO ] Deduced a trap composed of 85 places in 337 ms of which 1 ms to minimize.
[2023-03-13 07:26:45] [INFO ] Deduced a trap composed of 94 places in 783 ms of which 1 ms to minimize.
[2023-03-13 07:26:45] [INFO ] Deduced a trap composed of 75 places in 339 ms of which 1 ms to minimize.
[2023-03-13 07:26:46] [INFO ] Deduced a trap composed of 131 places in 400 ms of which 1 ms to minimize.
[2023-03-13 07:26:46] [INFO ] Deduced a trap composed of 136 places in 447 ms of which 1 ms to minimize.
[2023-03-13 07:26:47] [INFO ] Deduced a trap composed of 83 places in 375 ms of which 1 ms to minimize.
[2023-03-13 07:26:47] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 1 ms to minimize.
[2023-03-13 07:26:47] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 0 ms to minimize.
[2023-03-13 07:26:48] [INFO ] Deduced a trap composed of 92 places in 710 ms of which 1 ms to minimize.
[2023-03-13 07:26:49] [INFO ] Deduced a trap composed of 107 places in 324 ms of which 1 ms to minimize.
[2023-03-13 07:26:49] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 1 ms to minimize.
[2023-03-13 07:26:49] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 1 ms to minimize.
[2023-03-13 07:26:50] [INFO ] Deduced a trap composed of 132 places in 470 ms of which 1 ms to minimize.
[2023-03-13 07:26:50] [INFO ] Deduced a trap composed of 108 places in 366 ms of which 1 ms to minimize.
[2023-03-13 07:26:51] [INFO ] Deduced a trap composed of 89 places in 454 ms of which 1 ms to minimize.
[2023-03-13 07:26:51] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 0 ms to minimize.
[2023-03-13 07:26:51] [INFO ] Deduced a trap composed of 95 places in 454 ms of which 2 ms to minimize.
[2023-03-13 07:26:52] [INFO ] Deduced a trap composed of 183 places in 684 ms of which 2 ms to minimize.
[2023-03-13 07:26:53] [INFO ] Deduced a trap composed of 90 places in 404 ms of which 16 ms to minimize.
[2023-03-13 07:26:53] [INFO ] Deduced a trap composed of 186 places in 704 ms of which 5 ms to minimize.
[2023-03-13 07:26:54] [INFO ] Deduced a trap composed of 114 places in 584 ms of which 1 ms to minimize.
[2023-03-13 07:26:54] [INFO ] Deduced a trap composed of 181 places in 381 ms of which 0 ms to minimize.
[2023-03-13 07:26:55] [INFO ] Deduced a trap composed of 117 places in 569 ms of which 1 ms to minimize.
[2023-03-13 07:26:55] [INFO ] Deduced a trap composed of 100 places in 378 ms of which 1 ms to minimize.
[2023-03-13 07:26:56] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 20525 ms
[2023-03-13 07:26:57] [INFO ] Deduced a trap composed of 68 places in 865 ms of which 0 ms to minimize.
[2023-03-13 07:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1065 ms
[2023-03-13 07:26:57] [INFO ] Deduced a trap composed of 20 places in 366 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-13 07:26:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:26:57] [INFO ] After 25186ms 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-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 372 ms.
Support contains 51 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1126 transition count 735
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 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 455 rules applied. Total rules applied 844 place count 737 transition count 669
Reduce places removed 17 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 35 rules applied. Total rules applied 879 place count 720 transition count 651
Reduce places removed 18 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 23 rules applied. Total rules applied 902 place count 702 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 903 place count 701 transition count 646
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 136 Pre rules applied. Total rules applied 903 place count 701 transition count 510
Deduced a syphon composed of 136 places in 3 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 5 with 272 rules applied. Total rules applied 1175 place count 565 transition count 510
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 1269 place count 471 transition count 416
Iterating global reduction 5 with 94 rules applied. Total rules applied 1363 place count 471 transition count 416
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1366 place count 471 transition count 413
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1366 place count 471 transition count 388
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1416 place count 446 transition count 388
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 1620 place count 344 transition count 286
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 1622 place count 343 transition count 286
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1625 place count 343 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1627 place count 342 transition count 282
Free-agglomeration rule applied 45 times.
Iterating global reduction 6 with 45 rules applied. Total rules applied 1672 place count 342 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 1717 place count 297 transition count 237
Applied a total of 1717 rules in 179 ms. Remains 297 /1126 variables (removed 829) and now considering 237/1124 (removed 887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 297/1126 places, 237/1124 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 6) seen :4
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-10 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 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 237 rows 297 cols
[2023-03-13 07:26:58] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-13 07:26:58] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 07:26:59] [INFO ] [Nat]Absence check using 74 positive place invariants in 127 ms returned sat
[2023-03-13 07:26:59] [INFO ] [Nat]Absence check using 74 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-13 07:26:59] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 07:26:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-13 07:26:59] [INFO ] After 70ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 07:26:59] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 1 ms to minimize.
[2023-03-13 07:26:59] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 98 places in 210 ms of which 1 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 561 ms
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-13 07:27:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 637 ms
[2023-03-13 07:27:00] [INFO ] After 1349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-13 07:27:00] [INFO ] After 2115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 19 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 237/237 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 297 transition count 222
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 282 transition count 222
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 282 transition count 213
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 273 transition count 213
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 96 place count 249 transition count 189
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 249 transition count 184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 244 transition count 184
Applied a total of 106 rules in 66 ms. Remains 244 /297 variables (removed 53) and now considering 184/237 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 244/297 places, 184/237 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 244 cols
[2023-03-13 07:27:01] [INFO ] Computed 76 place invariants in 1 ms
[2023-03-13 07:27:01] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:27:01] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2023-03-13 07:27:01] [INFO ] [Nat]Absence check using 74 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-13 07:27:01] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:27:01] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-13 07:27:01] [INFO ] After 47ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:27:01] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 26 ms to minimize.
[2023-03-13 07:27:01] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 1 ms to minimize.
[2023-03-13 07:27:01] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 1 ms to minimize.
[2023-03-13 07:27:02] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 1 ms to minimize.
[2023-03-13 07:27:02] [INFO ] Deduced a trap composed of 104 places in 62 ms of which 0 ms to minimize.
[2023-03-13 07:27:02] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 1 ms to minimize.
[2023-03-13 07:27:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 694 ms
[2023-03-13 07:27:02] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-13 07:27:02] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 184/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 244/244 places, 184/184 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 501864 steps, run visited all 1 properties in 1647 ms. (steps per millisecond=304 )
Probabilistic random walk after 501864 steps, saw 135456 distinct states, run finished after 1647 ms. (steps per millisecond=304 ) properties seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 34063 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: AutoFlight_PT_12b
(NrP: 1126 NrTr: 1124 NrArc: 2618)

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

net check time: 0m 0.000sec

init dd package: 0m 3.006sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9382268 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16103580 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AutoFlight-PT-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 r010-oct2-167813599100478"
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 ;