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.r393-oct2-167903716600110.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 ShieldIIPs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 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 ShieldIIPs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679424324669

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=ShieldIIPs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:45:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 18:45:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:45:28] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-21 18:45:28] [INFO ] Transformed 1203 places.
[2023-03-21 18:45:28] [INFO ] Transformed 1183 transitions.
[2023-03-21 18:45:28] [INFO ] Found NUPN structural information;
[2023-03-21 18:45:28] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 15) seen :11
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-21 18:45:29] [INFO ] Computed 181 place invariants in 18 ms
[2023-03-21 18:45:30] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 18:45:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2023-03-21 18:45:33] [INFO ] After 2033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 18:45:34] [INFO ] Deduced a trap composed of 30 places in 1109 ms of which 21 ms to minimize.
[2023-03-21 18:45:34] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 2 ms to minimize.
[2023-03-21 18:45:35] [INFO ] Deduced a trap composed of 22 places in 787 ms of which 15 ms to minimize.
[2023-03-21 18:45:36] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 1 ms to minimize.
[2023-03-21 18:45:36] [INFO ] Deduced a trap composed of 38 places in 708 ms of which 15 ms to minimize.
[2023-03-21 18:45:37] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 1 ms to minimize.
[2023-03-21 18:45:37] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 0 ms to minimize.
[2023-03-21 18:45:38] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 13 ms to minimize.
[2023-03-21 18:45:38] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 1 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 1 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 31 places in 1361 ms of which 1 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 20 places in 649 ms of which 1 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 42 places in 452 ms of which 1 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 2 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 29 places in 625 ms of which 76 ms to minimize.
[2023-03-21 18:45:43] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 14 places in 654 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 14 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 15 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 29 places in 767 ms of which 1 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 21 places in 534 ms of which 7 ms to minimize.
[2023-03-21 18:45:48] [INFO ] Deduced a trap composed of 21 places in 703 ms of which 1 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 15 places in 623 ms of which 1 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 28 places in 1008 ms of which 0 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 25 places in 589 ms of which 1 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 25 places in 484 ms of which 1 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 19 places in 463 ms of which 1 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 19 places in 349 ms of which 1 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 26 places in 534 ms of which 1 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 13 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 1 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 1 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 28 places in 504 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 26 places in 283 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-21 18:45:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 18:45:55] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 148 ms.
Support contains 23 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1203 transition count 1087
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 194 place count 1107 transition count 1085
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 1105 transition count 1085
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 196 place count 1105 transition count 984
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 398 place count 1004 transition count 984
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 530 place count 872 transition count 852
Iterating global reduction 3 with 132 rules applied. Total rules applied 662 place count 872 transition count 852
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 662 place count 872 transition count 800
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 766 place count 820 transition count 800
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 2 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1350 place count 528 transition count 508
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 3 with 137 rules applied. Total rules applied 1487 place count 528 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1488 place count 527 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 526 transition count 507
Applied a total of 1489 rules in 444 ms. Remains 526 /1203 variables (removed 677) and now considering 507/1183 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 526/1203 places, 507/1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) 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 3) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 507 rows 526 cols
[2023-03-21 18:45:56] [INFO ] Computed 180 place invariants in 12 ms
[2023-03-21 18:45:56] [INFO ] [Real]Absence check using 178 positive place invariants in 26 ms returned sat
[2023-03-21 18:45:56] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 18:45:56] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 18:45:56] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2023-03-21 18:45:56] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 18:45:57] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 18:45:57] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-21 18:45:57] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 10 ms to minimize.
[2023-03-21 18:45:58] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-21 18:45:58] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-21 18:45:58] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-21 18:45:58] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 19 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-21 18:45:59] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 46 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2715 ms
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 5 ms to minimize.
[2023-03-21 18:46:00] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-21 18:46:01] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2023-03-21 18:46:01] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-21 18:46:01] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-21 18:46:01] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-21 18:46:01] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-21 18:46:02] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 0 ms to minimize.
[2023-03-21 18:46:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1868 ms
[2023-03-21 18:46:02] [INFO ] After 5098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-21 18:46:02] [INFO ] After 5338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 507/507 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 525 transition count 506
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 525 transition count 503
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 522 transition count 503
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 32 place count 510 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 510 transition count 491
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 508 transition count 489
Applied a total of 35 rules in 64 ms. Remains 508 /526 variables (removed 18) and now considering 489/507 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 508/526 places, 489/507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 299763 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{1=1}
Probabilistic random walk after 299763 steps, saw 204341 distinct states, run finished after 3014 ms. (steps per millisecond=99 ) properties seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 489 rows 508 cols
[2023-03-21 18:46:05] [INFO ] Computed 180 place invariants in 31 ms
[2023-03-21 18:46:05] [INFO ] [Real]Absence check using 179 positive place invariants in 126 ms returned sat
[2023-03-21 18:46:05] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:46:06] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:46:06] [INFO ] [Nat]Absence check using 179 positive place invariants in 39 ms returned sat
[2023-03-21 18:46:06] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 18:46:06] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:06] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-21 18:46:06] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 14 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 14 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1713 ms
[2023-03-21 18:46:08] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-21 18:46:08] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 489/489 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 508 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 507 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 504 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 502 transition count 483
Applied a total of 10 rules in 56 ms. Remains 502 /508 variables (removed 6) and now considering 483/489 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 502/508 places, 483/489 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 363626 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363626 steps, saw 229834 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 483 rows 502 cols
[2023-03-21 18:46:11] [INFO ] Computed 180 place invariants in 48 ms
[2023-03-21 18:46:12] [INFO ] [Real]Absence check using 179 positive place invariants in 739 ms returned sat
[2023-03-21 18:46:12] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-21 18:46:12] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:46:13] [INFO ] [Nat]Absence check using 179 positive place invariants in 32 ms returned sat
[2023-03-21 18:46:13] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:46:14] [INFO ] After 1548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:14] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-21 18:46:14] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2023-03-21 18:46:15] [INFO ] After 2084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-21 18:46:15] [INFO ] After 2372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2023-03-21 18:46:15] [INFO ] Invariant cache hit.
[2023-03-21 18:46:15] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-21 18:46:15] [INFO ] Invariant cache hit.
[2023-03-21 18:46:17] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2023-03-21 18:46:17] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-21 18:46:17] [INFO ] Invariant cache hit.
[2023-03-21 18:46:18] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 ms. Remains : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 18:46:18] [INFO ] Invariant cache hit.
[2023-03-21 18:46:18] [INFO ] [Real]Absence check using 179 positive place invariants in 87 ms returned sat
[2023-03-21 18:46:18] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 18:46:18] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:46:18] [INFO ] [Nat]Absence check using 179 positive place invariants in 39 ms returned sat
[2023-03-21 18:46:18] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 21 ms returned sat
[2023-03-21 18:46:19] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:20] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-21 18:46:20] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-21 18:46:20] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-21 18:46:20] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-21 18:46:20] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-21 18:46:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 750 ms
[2023-03-21 18:46:20] [INFO ] After 1813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-21 18:46:20] [INFO ] After 2113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-21 18:46:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 502 places, 483 transitions and 2299 arcs took 15 ms.
[2023-03-21 18:46:21] [INFO ] Flatten gal took : 105 ms
Total runtime 52860 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/766/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 11706200 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095032 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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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 r393-oct2-167903716600110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B 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 ;