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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 538K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-24b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678516964529

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-11 06:42:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:42:48] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-11 06:42:48] [INFO ] Transformed 2230 places.
[2023-03-11 06:42:48] [INFO ] Transformed 2228 transitions.
[2023-03-11 06:42:48] [INFO ] Found NUPN structural information;
[2023-03-11 06:42:48] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 06:42:48] [INFO ] Flatten gal took : 199 ms
[2023-03-11 06:42:48] [INFO ] Flatten gal took : 104 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-24b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
[2023-03-11 06:42:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4531613155402464524.gal : 49 ms
[2023-03-11 06:42:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17489478637532202729.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4531613155402464524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17489478637532202729.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Loading property file /tmp/ReachabilityCardinality17489478637532202729.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-11 06:42:49] [INFO ] Computed 148 place invariants in 35 ms
[2023-03-11 06:42:49] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:42:50] [INFO ] [Nat]Absence check using 147 positive place invariants in 93 ms returned sat
[2023-03-11 06:42:50] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 8
Invariant property AutoFlight-PT-24b-ReachabilityFireability-00 does not hold.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :8 after 17
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :17 after 26
[2023-03-11 06:42:53] [INFO ] After 2825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :26 after 43
[2023-03-11 06:42:55] [INFO ] Deduced a trap composed of 19 places in 961 ms of which 8 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :43 after 76
Invariant property AutoFlight-PT-24b-ReachabilityFireability-10 does not hold.
[2023-03-11 06:42:56] [INFO ] Deduced a trap composed of 42 places in 843 ms of which 4 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :76 after 129
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :129 after 3277
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3277 after 6.14202e+08
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :6.14202e+08 after 3.3187e+18
Reachability property AutoFlight-PT-24b-ReachabilityFireability-06 is true.
Reachability property AutoFlight-PT-24b-ReachabilityFireability-05 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :3.3187e+18 after 5.27514e+38
Reachability property AutoFlight-PT-24b-ReachabilityFireability-14 is true.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :5.27514e+38 after 9.24055e+58
[2023-03-11 06:42:57] [INFO ] Deduced a trap composed of 247 places in 839 ms of which 3 ms to minimize.
[2023-03-11 06:42:58] [INFO ] Deduced a trap composed of 72 places in 825 ms of which 5 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :9.24055e+58 after 1.69414e+81
[2023-03-11 06:42:59] [INFO ] Deduced a trap composed of 69 places in 818 ms of which 15 ms to minimize.
[2023-03-11 06:42:59] [INFO ] Deduced a trap composed of 73 places in 709 ms of which 3 ms to minimize.
Reachability property AutoFlight-PT-24b-ReachabilityFireability-12 is true.
[2023-03-11 06:43:00] [INFO ] Deduced a trap composed of 250 places in 720 ms of which 3 ms to minimize.
[2023-03-11 06:43:01] [INFO ] Deduced a trap composed of 258 places in 958 ms of which 1 ms to minimize.
[2023-03-11 06:43:02] [INFO ] Deduced a trap composed of 220 places in 729 ms of which 1 ms to minimize.
[2023-03-11 06:43:03] [INFO ] Deduced a trap composed of 232 places in 705 ms of which 2 ms to minimize.
[2023-03-11 06:43:05] [INFO ] Deduced a trap composed of 84 places in 1323 ms of which 1 ms to minimize.
[2023-03-11 06:43:05] [INFO ] Deduced a trap composed of 78 places in 689 ms of which 5 ms to minimize.
[2023-03-11 06:43:06] [INFO ] Deduced a trap composed of 247 places in 740 ms of which 3 ms to minimize.
[2023-03-11 06:43:07] [INFO ] Deduced a trap composed of 256 places in 623 ms of which 4 ms to minimize.
[2023-03-11 06:43:08] [INFO ] Deduced a trap composed of 239 places in 750 ms of which 2 ms to minimize.
[2023-03-11 06:43:09] [INFO ] Deduced a trap composed of 86 places in 602 ms of which 1 ms to minimize.
[2023-03-11 06:43:09] [INFO ] Deduced a trap composed of 82 places in 611 ms of which 1 ms to minimize.
[2023-03-11 06:43:10] [INFO ] Deduced a trap composed of 88 places in 602 ms of which 1 ms to minimize.
[2023-03-11 06:43:11] [INFO ] Deduced a trap composed of 236 places in 589 ms of which 1 ms to minimize.
[2023-03-11 06:43:12] [INFO ] Deduced a trap composed of 252 places in 1310 ms of which 1 ms to minimize.
[2023-03-11 06:43:13] [INFO ] Deduced a trap composed of 230 places in 582 ms of which 1 ms to minimize.
[2023-03-11 06:43:14] [INFO ] Deduced a trap composed of 96 places in 674 ms of which 4 ms to minimize.
[2023-03-11 06:43:15] [INFO ] Deduced a trap composed of 273 places in 793 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-11 06:43:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:43:15] [INFO ] After 25257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA AutoFlight-PT-24b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 221 ms.
Support contains 56 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 824 transitions
Trivial Post-agglo rules discarded 824 transitions
Performed 824 trivial Post agglomeration. Transition count delta: 824
Iterating post reduction 0 with 824 rules applied. Total rules applied 824 place count 2230 transition count 1404
Reduce places removed 824 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 967 rules applied. Total rules applied 1791 place count 1406 transition count 1261
Reduce places removed 40 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 76 rules applied. Total rules applied 1867 place count 1366 transition count 1225
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 49 rules applied. Total rules applied 1916 place count 1330 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1917 place count 1329 transition count 1212
Performed 276 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 276 Pre rules applied. Total rules applied 1917 place count 1329 transition count 936
Deduced a syphon composed of 276 places in 4 ms
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 5 with 552 rules applied. Total rules applied 2469 place count 1053 transition count 936
Discarding 203 places :
Symmetric choice reduction at 5 with 203 rule applications. Total rules 2672 place count 850 transition count 733
Iterating global reduction 5 with 203 rules applied. Total rules applied 2875 place count 850 transition count 733
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 2875 place count 850 transition count 671
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 2999 place count 788 transition count 671
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 1 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 5 with 368 rules applied. Total rules applied 3367 place count 604 transition count 487
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3371 place count 602 transition count 488
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3374 place count 602 transition count 485
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3376 place count 601 transition count 484
Free-agglomeration rule applied 82 times.
Iterating global reduction 5 with 82 rules applied. Total rules applied 3458 place count 601 transition count 402
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 3540 place count 519 transition count 402
Applied a total of 3540 rules in 574 ms. Remains 519 /2230 variables (removed 1711) and now considering 402/2228 (removed 1826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 519/2230 places, 402/2228 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :4
FORMULA AutoFlight-PT-24b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 402 rows 519 cols
[2023-03-11 06:43:16] [INFO ] Computed 148 place invariants in 6 ms
[2023-03-11 06:43:16] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:43:16] [INFO ] [Nat]Absence check using 146 positive place invariants in 24 ms returned sat
[2023-03-11 06:43:16] [INFO ] [Nat]Absence check using 146 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 06:43:16] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:43:16] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-11 06:43:16] [INFO ] After 129ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:43:17] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 1 ms to minimize.
[2023-03-11 06:43:17] [INFO ] Deduced a trap composed of 199 places in 97 ms of which 0 ms to minimize.
[2023-03-11 06:43:17] [INFO ] Deduced a trap composed of 146 places in 233 ms of which 1 ms to minimize.
[2023-03-11 06:43:17] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 0 ms to minimize.
[2023-03-11 06:43:17] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 1 ms to minimize.
[2023-03-11 06:43:18] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-11 06:43:18] [INFO ] Deduced a trap composed of 194 places in 180 ms of which 0 ms to minimize.
[2023-03-11 06:43:18] [INFO ] Deduced a trap composed of 148 places in 306 ms of which 0 ms to minimize.
[2023-03-11 06:43:18] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 1 ms to minimize.
[2023-03-11 06:43:18] [INFO ] Deduced a trap composed of 192 places in 200 ms of which 0 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 202 places in 97 ms of which 2 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 210 places in 124 ms of which 0 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 198 places in 122 ms of which 1 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 208 places in 119 ms of which 0 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 207 places in 94 ms of which 1 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 204 places in 77 ms of which 1 ms to minimize.
[2023-03-11 06:43:19] [INFO ] Deduced a trap composed of 155 places in 78 ms of which 1 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 156 places in 96 ms of which 2 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 139 places in 99 ms of which 1 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 148 places in 91 ms of which 0 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 149 places in 91 ms of which 0 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 158 places in 94 ms of which 1 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 152 places in 96 ms of which 0 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 159 places in 122 ms of which 0 ms to minimize.
[2023-03-11 06:43:20] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 0 ms to minimize.
[2023-03-11 06:43:21] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 21 ms to minimize.
[2023-03-11 06:43:21] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-11 06:43:21] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 1 ms to minimize.
[2023-03-11 06:43:21] [INFO ] Deduced a trap composed of 206 places in 102 ms of which 1 ms to minimize.
[2023-03-11 06:43:21] [INFO ] Deduced a trap composed of 146 places in 291 ms of which 1 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 149 places in 123 ms of which 1 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 158 places in 126 ms of which 1 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 218 places in 134 ms of which 0 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 202 places in 98 ms of which 0 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 210 places in 109 ms of which 0 ms to minimize.
[2023-03-11 06:43:22] [INFO ] Deduced a trap composed of 214 places in 92 ms of which 0 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 206 places in 128 ms of which 0 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 216 places in 142 ms of which 2 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 218 places in 102 ms of which 14 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 1 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-11 06:43:23] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 6789 ms
[2023-03-11 06:43:23] [INFO ] Deduced a trap composed of 210 places in 140 ms of which 1 ms to minimize.
[2023-03-11 06:43:24] [INFO ] Deduced a trap composed of 221 places in 125 ms of which 14 ms to minimize.
[2023-03-11 06:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-03-11 06:43:24] [INFO ] After 7431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-11 06:43:24] [INFO ] After 7888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 22 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 402/402 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 519 transition count 386
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 503 transition count 386
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 503 transition count 375
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 492 transition count 375
Performed 22 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 98 place count 470 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 470 transition count 348
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 470 transition count 338
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 460 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 459 transition count 337
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 33 rules applied. Total rules applied 154 place count 431 transition count 332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 159 place count 426 transition count 332
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 159 place count 426 transition count 310
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 203 place count 404 transition count 310
Applied a total of 203 rules in 136 ms. Remains 404 /519 variables (removed 115) and now considering 310/402 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 404/519 places, 310/402 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-24b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 404 cols
[2023-03-11 06:43:24] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-11 06:43:24] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:43:24] [INFO ] [Nat]Absence check using 118 positive place invariants in 15 ms returned sat
[2023-03-11 06:43:24] [INFO ] [Nat]Absence check using 118 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 06:43:24] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:43:24] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-11 06:43:24] [INFO ] After 31ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:43:24] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 06:43:24] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 310/310 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 304
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 398 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 397 transition count 303
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 397 transition count 299
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 24 place count 391 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 391 transition count 297
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 389 transition count 297
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 383 transition count 291
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 383 transition count 288
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 380 transition count 288
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 380 transition count 288
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 54 place count 376 transition count 284
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 376 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 374 transition count 282
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 4 with 227 rules applied. Total rules applied 287 place count 302 transition count 127
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 5 with 155 rules applied. Total rules applied 442 place count 147 transition count 127
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 442 place count 147 transition count 95
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 506 place count 115 transition count 95
Applied a total of 506 rules in 61 ms. Remains 115 /404 variables (removed 289) and now considering 95/310 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 115/404 places, 95/310 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished Best-First random walk after 5014 steps, including 5 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1002 )
FORMULA AutoFlight-PT-24b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 37384 ms.

BK_STOP 1678517005681

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-24b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-24b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593200495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;