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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679436575859

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:09:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:09:38] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-21 22:09:38] [INFO ] Transformed 1403 places.
[2023-03-21 22:09:38] [INFO ] Transformed 1303 transitions.
[2023-03-21 22:09:38] [INFO ] Found NUPN structural information;
[2023-03-21 22:09:38] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 16) seen :11
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-21 22:09:39] [INFO ] Computed 181 place invariants in 28 ms
[2023-03-21 22:09:40] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:09:40] [INFO ] [Nat]Absence check using 181 positive place invariants in 56 ms returned sat
[2023-03-21 22:09:43] [INFO ] After 2670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:09:44] [INFO ] Deduced a trap composed of 21 places in 585 ms of which 26 ms to minimize.
[2023-03-21 22:09:45] [INFO ] Deduced a trap composed of 18 places in 558 ms of which 4 ms to minimize.
[2023-03-21 22:09:45] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 1 ms to minimize.
[2023-03-21 22:09:46] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 18 ms to minimize.
[2023-03-21 22:09:46] [INFO ] Deduced a trap composed of 20 places in 579 ms of which 2 ms to minimize.
[2023-03-21 22:09:47] [INFO ] Deduced a trap composed of 16 places in 729 ms of which 1 ms to minimize.
[2023-03-21 22:09:48] [INFO ] Deduced a trap composed of 28 places in 577 ms of which 0 ms to minimize.
[2023-03-21 22:09:48] [INFO ] Deduced a trap composed of 19 places in 444 ms of which 1 ms to minimize.
[2023-03-21 22:09:48] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 0 ms to minimize.
[2023-03-21 22:09:49] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 2 ms to minimize.
[2023-03-21 22:09:49] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2023-03-21 22:09:50] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 0 ms to minimize.
[2023-03-21 22:09:50] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 0 ms to minimize.
[2023-03-21 22:09:50] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 0 ms to minimize.
[2023-03-21 22:09:51] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
[2023-03-21 22:09:51] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 3 ms to minimize.
[2023-03-21 22:09:51] [INFO ] Deduced a trap composed of 31 places in 451 ms of which 2 ms to minimize.
[2023-03-21 22:09:52] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2023-03-21 22:09:52] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2023-03-21 22:09:52] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 1 ms to minimize.
[2023-03-21 22:09:53] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 1 ms to minimize.
[2023-03-21 22:09:53] [INFO ] Deduced a trap composed of 33 places in 351 ms of which 10 ms to minimize.
[2023-03-21 22:09:54] [INFO ] Deduced a trap composed of 34 places in 365 ms of which 1 ms to minimize.
[2023-03-21 22:09:54] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10151 ms
[2023-03-21 22:09:54] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 16 ms to minimize.
[2023-03-21 22:09:55] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 1 ms to minimize.
[2023-03-21 22:09:55] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 0 ms to minimize.
[2023-03-21 22:09:56] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 1 ms to minimize.
[2023-03-21 22:09:56] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 1 ms to minimize.
[2023-03-21 22:09:56] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 1 ms to minimize.
[2023-03-21 22:09:57] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 1 ms to minimize.
[2023-03-21 22:09:57] [INFO ] Deduced a trap composed of 26 places in 434 ms of which 1 ms to minimize.
[2023-03-21 22:09:58] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2023-03-21 22:09:58] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 0 ms to minimize.
[2023-03-21 22:09:59] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 14 ms to minimize.
[2023-03-21 22:09:59] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 1 ms to minimize.
[2023-03-21 22:10:00] [INFO ] Deduced a trap composed of 20 places in 350 ms of which 1 ms to minimize.
[2023-03-21 22:10:00] [INFO ] Deduced a trap composed of 23 places in 519 ms of which 1 ms to minimize.
[2023-03-21 22:10:01] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 27 ms to minimize.
[2023-03-21 22:10:01] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-21 22:10:01] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 1 ms to minimize.
[2023-03-21 22:10:02] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 1 ms to minimize.
[2023-03-21 22:10:02] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 1 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 1 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 1 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 0 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 1 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 0 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 24 places in 255 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 22:10:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:10:05] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 155 ms.
Support contains 119 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1403 transition count 1060
Reduce places removed 243 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 245 rules applied. Total rules applied 488 place count 1160 transition count 1058
Reduce places removed 1 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 37 rules applied. Total rules applied 525 place count 1159 transition count 1022
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 561 place count 1123 transition count 1022
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 561 place count 1123 transition count 931
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 743 place count 1032 transition count 931
Discarding 128 places :
Symmetric choice reduction at 4 with 128 rule applications. Total rules 871 place count 904 transition count 803
Iterating global reduction 4 with 128 rules applied. Total rules applied 999 place count 904 transition count 803
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 999 place count 904 transition count 762
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1081 place count 863 transition count 762
Performed 277 Post agglomeration using F-continuation condition.Transition count delta: 277
Deduced a syphon composed of 277 places in 2 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 4 with 554 rules applied. Total rules applied 1635 place count 586 transition count 485
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1713 place count 547 transition count 498
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1718 place count 547 transition count 493
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1723 place count 542 transition count 493
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 1738 place count 542 transition count 493
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1739 place count 542 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1740 place count 541 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1741 place count 540 transition count 492
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1741 place count 540 transition count 491
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 1743 place count 539 transition count 491
Applied a total of 1743 rules in 433 ms. Remains 539 /1403 variables (removed 864) and now considering 491/1303 (removed 812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 539/1403 places, 491/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 491 rows 539 cols
[2023-03-21 22:10:06] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 22:10:06] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:10:06] [INFO ] [Nat]Absence check using 180 positive place invariants in 30 ms returned sat
[2023-03-21 22:10:07] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:10:07] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-21 22:10:07] [INFO ] After 373ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:10:07] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 11 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 0 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1655 ms
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 0 ms to minimize.
[2023-03-21 22:10:10] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 0 ms to minimize.
[2023-03-21 22:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 812 ms
[2023-03-21 22:10:10] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2023-03-21 22:10:10] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-21 22:10:10] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-21 22:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 615 ms
[2023-03-21 22:10:11] [INFO ] After 3838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-21 22:10:11] [INFO ] After 4925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 88 ms.
Support contains 77 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 491/491 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 539 transition count 482
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 530 transition count 482
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 530 transition count 470
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 42 place count 518 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 516 transition count 468
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 516 transition count 468
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 73 rules applied. Total rules applied 119 place count 479 transition count 432
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 127 place count 475 transition count 436
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 475 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 474 transition count 435
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 474 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 473 transition count 434
Applied a total of 132 rules in 145 ms. Remains 473 /539 variables (removed 66) and now considering 434/491 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 473/539 places, 434/491 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 434 rows 473 cols
[2023-03-21 22:10:12] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:10:12] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:10:12] [INFO ] [Nat]Absence check using 179 positive place invariants in 96 ms returned sat
[2023-03-21 22:10:13] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:10:13] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-21 22:10:13] [INFO ] After 465ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1275 ms
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
[2023-03-21 22:10:16] [INFO ] After 3084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-21 22:10:16] [INFO ] After 4458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 109 ms.
Support contains 74 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 434/434 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 473 transition count 433
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 472 transition count 433
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 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 432
Applied a total of 4 rules in 36 ms. Remains 471 /473 variables (removed 2) and now considering 432/434 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 471/473 places, 432/434 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 471 cols
[2023-03-21 22:10:17] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:10:17] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:17] [INFO ] [Nat]Absence check using 179 positive place invariants in 70 ms returned sat
[2023-03-21 22:10:17] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-21 22:10:17] [INFO ] After 134ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:17] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 29 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 449 ms
[2023-03-21 22:10:18] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-21 22:10:18] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 471 transition count 422
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 461 transition count 420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 459 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 24 place count 459 transition count 408
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 48 place count 447 transition count 408
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 100 place count 421 transition count 382
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 120 place count 411 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 411 transition count 387
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 411 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 409 transition count 385
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 133 place count 409 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 407 transition count 383
Applied a total of 135 rules in 143 ms. Remains 407 /471 variables (removed 64) and now considering 383/432 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 407/471 places, 383/432 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 475680 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475680 steps, saw 370878 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 407 cols
[2023-03-21 22:10:21] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:10:21] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:21] [INFO ] [Nat]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-21 22:10:22] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-21 22:10:22] [INFO ] After 40ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:22] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-21 22:10:22] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 24 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 383/383 transitions.
Applied a total of 0 rules in 9 ms. Remains 407 /407 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 407/407 places, 383/383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 383/383 transitions.
Applied a total of 0 rules in 18 ms. Remains 407 /407 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-21 22:10:22] [INFO ] Invariant cache hit.
[2023-03-21 22:10:22] [INFO ] Implicit Places using invariants in 392 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 406/407 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 405 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 405 transition count 382
Applied a total of 2 rules in 9 ms. Remains 405 /406 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 405 cols
[2023-03-21 22:10:22] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:10:22] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-21 22:10:22] [INFO ] Invariant cache hit.
[2023-03-21 22:10:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:10:23] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 405/407 places, 382/383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1270 ms. Remains : 405/407 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 514936 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514936 steps, saw 386014 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:10:26] [INFO ] Invariant cache hit.
[2023-03-21 22:10:26] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:26] [INFO ] [Nat]Absence check using 178 positive place invariants in 34 ms returned sat
[2023-03-21 22:10:27] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:10:27] [INFO ] After 67ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:27] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-21 22:10:27] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 24 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 382/382 transitions.
Applied a total of 0 rules in 28 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 405/405 places, 382/382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 382/382 transitions.
Applied a total of 0 rules in 29 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-21 22:10:27] [INFO ] Invariant cache hit.
[2023-03-21 22:10:27] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-21 22:10:27] [INFO ] Invariant cache hit.
[2023-03-21 22:10:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:10:28] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2023-03-21 22:10:28] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-21 22:10:28] [INFO ] Invariant cache hit.
[2023-03-21 22:10:28] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1346 ms. Remains : 405/405 places, 382/382 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 405 transition count 382
Applied a total of 40 rules in 20 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 405 cols
[2023-03-21 22:10:28] [INFO ] Computed 178 place invariants in 18 ms
[2023-03-21 22:10:28] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:29] [INFO ] [Nat]Absence check using 178 positive place invariants in 67 ms returned sat
[2023-03-21 22:10:29] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-21 22:10:29] [INFO ] After 36ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:29] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2023-03-21 22:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-21 22:10:29] [INFO ] After 156ms 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 22:10:29] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-21 22:10:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 405 places, 382 transitions and 1765 arcs took 4 ms.
[2023-03-21 22:10:29] [INFO ] Flatten gal took : 81 ms
Total runtime 51237 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 --inv-bin-par --invariant=/tmp/803/inv_0_ --inv-par
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679436635918

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldIIPt-PT-020B-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/803/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 405 places, 382 transitions and 1765 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_020B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 382->236 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 405; there are 236 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/803/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 5.400 real 21.440 user 0.150 sys
pnml2lts-sym: max token count: 1

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-020B, 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 r393-oct2-167903716800287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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