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.r394-oct2-167903717600175.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679497495638

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:04:59] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2023-03-22 15:04:59] [INFO ] Transformed 6003 places.
[2023-03-22 15:04:59] [INFO ] Transformed 5903 transitions.
[2023-03-22 15:04:59] [INFO ] Found NUPN structural information;
[2023-03-22 15:04:59] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 16) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-22 15:05:01] [INFO ] Computed 901 place invariants in 56 ms
[2023-03-22 15:05:03] [INFO ] After 2759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 15:05:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 1552 ms returned sat
[2023-03-22 15:05:29] [INFO ] After 19809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 15:05:29] [INFO ] After 19864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 15:05:29] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 192 ms.
Support contains 245 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 459 transitions
Trivial Post-agglo rules discarded 459 transitions
Performed 459 trivial Post agglomeration. Transition count delta: 459
Iterating post reduction 0 with 459 rules applied. Total rules applied 459 place count 6003 transition count 5444
Reduce places removed 459 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 470 rules applied. Total rules applied 929 place count 5544 transition count 5433
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 940 place count 5533 transition count 5433
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 940 place count 5533 transition count 4941
Deduced a syphon composed of 492 places in 23 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 1924 place count 5041 transition count 4941
Discarding 658 places :
Symmetric choice reduction at 3 with 658 rule applications. Total rules 2582 place count 4383 transition count 4283
Iterating global reduction 3 with 658 rules applied. Total rules applied 3240 place count 4383 transition count 4283
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 3240 place count 4383 transition count 4050
Deduced a syphon composed of 233 places in 26 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 3706 place count 4150 transition count 4050
Performed 1432 Post agglomeration using F-continuation condition.Transition count delta: 1432
Deduced a syphon composed of 1432 places in 39 ms
Reduce places removed 1432 places and 0 transitions.
Iterating global reduction 3 with 2864 rules applied. Total rules applied 6570 place count 2718 transition count 2618
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 635 times.
Drop transitions removed 635 transitions
Iterating global reduction 3 with 635 rules applied. Total rules applied 7205 place count 2718 transition count 2618
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7206 place count 2717 transition count 2617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7207 place count 2716 transition count 2617
Applied a total of 7207 rules in 2668 ms. Remains 2716 /6003 variables (removed 3287) and now considering 2617/5903 (removed 3286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2672 ms. Remains : 2716/6003 places, 2617/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 11) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2617 rows 2716 cols
[2023-03-22 15:05:33] [INFO ] Computed 900 place invariants in 63 ms
[2023-03-22 15:05:33] [INFO ] After 730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:05:34] [INFO ] [Nat]Absence check using 879 positive place invariants in 271 ms returned sat
[2023-03-22 15:05:34] [INFO ] [Nat]Absence check using 879 positive and 21 generalized place invariants in 25 ms returned sat
[2023-03-22 15:05:39] [INFO ] After 4224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:05:40] [INFO ] Deduced a trap composed of 5 places in 709 ms of which 7 ms to minimize.
[2023-03-22 15:05:42] [INFO ] Deduced a trap composed of 7 places in 1161 ms of which 3 ms to minimize.
[2023-03-22 15:05:42] [INFO ] Deduced a trap composed of 6 places in 661 ms of which 2 ms to minimize.
[2023-03-22 15:05:43] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 28 ms to minimize.
[2023-03-22 15:05:44] [INFO ] Deduced a trap composed of 6 places in 624 ms of which 3 ms to minimize.
[2023-03-22 15:05:46] [INFO ] Deduced a trap composed of 6 places in 1646 ms of which 1 ms to minimize.
[2023-03-22 15:05:47] [INFO ] Deduced a trap composed of 10 places in 952 ms of which 5 ms to minimize.
[2023-03-22 15:05:48] [INFO ] Deduced a trap composed of 11 places in 801 ms of which 1 ms to minimize.
[2023-03-22 15:05:49] [INFO ] Deduced a trap composed of 11 places in 1036 ms of which 1 ms to minimize.
[2023-03-22 15:05:50] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2023-03-22 15:05:50] [INFO ] Deduced a trap composed of 11 places in 399 ms of which 1 ms to minimize.
[2023-03-22 15:05:51] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2023-03-22 15:05:52] [INFO ] Deduced a trap composed of 4 places in 698 ms of which 1 ms to minimize.
[2023-03-22 15:05:53] [INFO ] Deduced a trap composed of 9 places in 676 ms of which 1 ms to minimize.
[2023-03-22 15:05:53] [INFO ] Deduced a trap composed of 15 places in 526 ms of which 23 ms to minimize.
[2023-03-22 15:05:54] [INFO ] Deduced a trap composed of 7 places in 507 ms of which 1 ms to minimize.
[2023-03-22 15:05:54] [INFO ] Deduced a trap composed of 14 places in 442 ms of which 1 ms to minimize.
[2023-03-22 15:05:55] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 0 ms to minimize.
[2023-03-22 15:05:56] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 2 ms to minimize.
[2023-03-22 15:05:56] [INFO ] Deduced a trap composed of 7 places in 501 ms of which 1 ms to minimize.
[2023-03-22 15:05:57] [INFO ] Deduced a trap composed of 14 places in 522 ms of which 1 ms to minimize.
[2023-03-22 15:05:58] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 27 ms to minimize.
[2023-03-22 15:05:58] [INFO ] Deduced a trap composed of 7 places in 526 ms of which 1 ms to minimize.
[2023-03-22 15:05:59] [INFO ] Deduced a trap composed of 13 places in 682 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 15:05:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:05:59] [INFO ] After 25642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 959 ms.
Support contains 125 out of 2716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2716/2716 places, 2617/2617 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 2716 transition count 2607
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 2706 transition count 2607
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 20 place count 2706 transition count 2585
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 64 place count 2684 transition count 2585
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 10 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 202 place count 2615 transition count 2516
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 233 place count 2615 transition count 2516
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 2613 transition count 2514
Applied a total of 235 rules in 410 ms. Remains 2613 /2716 variables (removed 103) and now considering 2514/2617 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 2613/2716 places, 2514/2617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 52963 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52963 steps, saw 51302 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2514 rows 2613 cols
[2023-03-22 15:06:05] [INFO ] Computed 900 place invariants in 105 ms
[2023-03-22 15:06:06] [INFO ] After 814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:06:08] [INFO ] [Nat]Absence check using 886 positive place invariants in 2009 ms returned sat
[2023-03-22 15:06:08] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-22 15:06:13] [INFO ] After 3977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:06:14] [INFO ] Deduced a trap composed of 6 places in 999 ms of which 1 ms to minimize.
[2023-03-22 15:06:15] [INFO ] Deduced a trap composed of 7 places in 869 ms of which 1 ms to minimize.
[2023-03-22 15:06:17] [INFO ] Deduced a trap composed of 5 places in 2045 ms of which 1 ms to minimize.
[2023-03-22 15:06:18] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 1 ms to minimize.
[2023-03-22 15:06:19] [INFO ] Deduced a trap composed of 6 places in 787 ms of which 1 ms to minimize.
[2023-03-22 15:06:19] [INFO ] Deduced a trap composed of 5 places in 518 ms of which 0 ms to minimize.
[2023-03-22 15:06:20] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 1 ms to minimize.
[2023-03-22 15:06:20] [INFO ] Deduced a trap composed of 5 places in 484 ms of which 1 ms to minimize.
[2023-03-22 15:06:21] [INFO ] Deduced a trap composed of 8 places in 632 ms of which 2 ms to minimize.
[2023-03-22 15:06:22] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 18 ms to minimize.
[2023-03-22 15:06:23] [INFO ] Deduced a trap composed of 8 places in 729 ms of which 4 ms to minimize.
[2023-03-22 15:06:24] [INFO ] Deduced a trap composed of 12 places in 1446 ms of which 2 ms to minimize.
[2023-03-22 15:06:25] [INFO ] Deduced a trap composed of 9 places in 838 ms of which 0 ms to minimize.
[2023-03-22 15:06:29] [INFO ] Deduced a trap composed of 11 places in 3673 ms of which 1 ms to minimize.
[2023-03-22 15:06:30] [INFO ] Deduced a trap composed of 9 places in 425 ms of which 1 ms to minimize.
[2023-03-22 15:06:31] [INFO ] Deduced a trap composed of 10 places in 1004 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-22 15:06:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 15:06:31] [INFO ] After 25173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1220 ms.
Support contains 125 out of 2613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 89 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 112 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-22 15:06:32] [INFO ] Invariant cache hit.
[2023-03-22 15:06:36] [INFO ] Implicit Places using invariants in 3464 ms returned []
[2023-03-22 15:06:36] [INFO ] Invariant cache hit.
[2023-03-22 15:06:42] [INFO ] Implicit Places using invariants and state equation in 6237 ms returned []
Implicit Place search using SMT with State Equation took 9708 ms to find 0 implicit places.
[2023-03-22 15:06:42] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-22 15:06:42] [INFO ] Invariant cache hit.
[2023-03-22 15:06:44] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12188 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 91 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-22 15:06:44] [INFO ] Invariant cache hit.
[2023-03-22 15:06:45] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:06:46] [INFO ] [Nat]Absence check using 886 positive place invariants in 373 ms returned sat
[2023-03-22 15:06:46] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-22 15:06:50] [INFO ] After 3753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 15:06:53] [INFO ] Deduced a trap composed of 9 places in 1987 ms of which 16 ms to minimize.
[2023-03-22 15:06:59] [INFO ] Deduced a trap composed of 4 places in 6292 ms of which 1 ms to minimize.
[2023-03-22 15:07:02] [INFO ] Deduced a trap composed of 6 places in 2924 ms of which 13 ms to minimize.
[2023-03-22 15:07:03] [INFO ] Deduced a trap composed of 5 places in 899 ms of which 1 ms to minimize.
[2023-03-22 15:07:05] [INFO ] Deduced a trap composed of 5 places in 1548 ms of which 2 ms to minimize.
[2023-03-22 15:07:06] [INFO ] Deduced a trap composed of 5 places in 956 ms of which 2 ms to minimize.
[2023-03-22 15:07:07] [INFO ] Deduced a trap composed of 6 places in 806 ms of which 2 ms to minimize.
[2023-03-22 15:07:08] [INFO ] Deduced a trap composed of 5 places in 971 ms of which 1 ms to minimize.
[2023-03-22 15:07:09] [INFO ] Deduced a trap composed of 7 places in 788 ms of which 2 ms to minimize.
[2023-03-22 15:07:11] [INFO ] Deduced a trap composed of 9 places in 2092 ms of which 1 ms to minimize.
[2023-03-22 15:07:13] [INFO ] Deduced a trap composed of 7 places in 1580 ms of which 45 ms to minimize.
[2023-03-22 15:07:14] [INFO ] Deduced a trap composed of 6 places in 1294 ms of which 1 ms to minimize.
[2023-03-22 15:07:15] [INFO ] Deduced a trap composed of 16 places in 898 ms of which 5 ms to minimize.
[2023-03-22 15:07:16] [INFO ] Deduced a trap composed of 9 places in 975 ms of which 1 ms to minimize.
[2023-03-22 15:07:18] [INFO ] Deduced a trap composed of 11 places in 1203 ms of which 2 ms to minimize.
[2023-03-22 15:07:19] [INFO ] Deduced a trap composed of 7 places in 627 ms of which 5 ms to minimize.
[2023-03-22 15:07:20] [INFO ] Deduced a trap composed of 9 places in 952 ms of which 3 ms to minimize.
[2023-03-22 15:07:20] [INFO ] Deduced a trap composed of 10 places in 653 ms of which 2 ms to minimize.
[2023-03-22 15:07:21] [INFO ] Deduced a trap composed of 12 places in 936 ms of which 1 ms to minimize.
[2023-03-22 15:07:22] [INFO ] Deduced a trap composed of 11 places in 772 ms of which 1 ms to minimize.
[2023-03-22 15:07:23] [INFO ] Deduced a trap composed of 11 places in 821 ms of which 1 ms to minimize.
[2023-03-22 15:07:24] [INFO ] Deduced a trap composed of 9 places in 630 ms of which 2 ms to minimize.
[2023-03-22 15:07:25] [INFO ] Deduced a trap composed of 9 places in 748 ms of which 1 ms to minimize.
[2023-03-22 15:07:26] [INFO ] Deduced a trap composed of 18 places in 720 ms of which 2 ms to minimize.
[2023-03-22 15:07:27] [INFO ] Deduced a trap composed of 11 places in 644 ms of which 2 ms to minimize.
[2023-03-22 15:07:27] [INFO ] Deduced a trap composed of 11 places in 611 ms of which 1 ms to minimize.
[2023-03-22 15:07:28] [INFO ] Deduced a trap composed of 12 places in 633 ms of which 10 ms to minimize.
[2023-03-22 15:07:29] [INFO ] Deduced a trap composed of 19 places in 924 ms of which 20 ms to minimize.
[2023-03-22 15:07:32] [INFO ] Deduced a trap composed of 13 places in 2758 ms of which 34 ms to minimize.
[2023-03-22 15:07:35] [INFO ] Deduced a trap composed of 14 places in 2982 ms of which 1 ms to minimize.
[2023-03-22 15:07:37] [INFO ] Deduced a trap composed of 25 places in 2130 ms of which 1 ms to minimize.
[2023-03-22 15:07:38] [INFO ] Deduced a trap composed of 19 places in 497 ms of which 1 ms to minimize.
[2023-03-22 15:07:39] [INFO ] Deduced a trap composed of 24 places in 983 ms of which 1 ms to minimize.
[2023-03-22 15:07:40] [INFO ] Deduced a trap composed of 19 places in 1035 ms of which 0 ms to minimize.
[2023-03-22 15:07:40] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 49959 ms
[2023-03-22 15:07:41] [INFO ] Deduced a trap composed of 9 places in 454 ms of which 2 ms to minimize.
[2023-03-22 15:07:42] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2023-03-22 15:07:42] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 0 ms to minimize.
[2023-03-22 15:07:42] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 1 ms to minimize.
[2023-03-22 15:07:44] [INFO ] Deduced a trap composed of 14 places in 1389 ms of which 28 ms to minimize.
[2023-03-22 15:07:45] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 1 ms to minimize.
[2023-03-22 15:07:46] [INFO ] Deduced a trap composed of 10 places in 990 ms of which 2 ms to minimize.
[2023-03-22 15:07:46] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 1 ms to minimize.
[2023-03-22 15:07:47] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-22 15:07:47] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 1 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 0 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-22 15:07:49] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 1 ms to minimize.
[2023-03-22 15:07:49] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2023-03-22 15:07:50] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 1 ms to minimize.
[2023-03-22 15:07:50] [INFO ] Deduced a trap composed of 14 places in 713 ms of which 1 ms to minimize.
[2023-03-22 15:07:51] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 1 ms to minimize.
[2023-03-22 15:07:52] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-22 15:07:52] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 1 ms to minimize.
[2023-03-22 15:07:53] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 2 ms to minimize.
[2023-03-22 15:07:53] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 0 ms to minimize.
[2023-03-22 15:07:53] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 0 ms to minimize.
[2023-03-22 15:07:54] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2023-03-22 15:07:54] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 0 ms to minimize.
[2023-03-22 15:07:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 13789 ms
[2023-03-22 15:07:56] [INFO ] Deduced a trap composed of 11 places in 926 ms of which 1 ms to minimize.
[2023-03-22 15:07:56] [INFO ] Deduced a trap composed of 6 places in 472 ms of which 1 ms to minimize.
[2023-03-22 15:07:57] [INFO ] Deduced a trap composed of 8 places in 738 ms of which 1 ms to minimize.
[2023-03-22 15:07:58] [INFO ] Deduced a trap composed of 16 places in 713 ms of which 1 ms to minimize.
[2023-03-22 15:07:59] [INFO ] Deduced a trap composed of 8 places in 481 ms of which 1 ms to minimize.
[2023-03-22 15:07:59] [INFO ] Deduced a trap composed of 9 places in 463 ms of which 1 ms to minimize.
[2023-03-22 15:08:00] [INFO ] Deduced a trap composed of 11 places in 707 ms of which 1 ms to minimize.
[2023-03-22 15:08:01] [INFO ] Deduced a trap composed of 5 places in 675 ms of which 1 ms to minimize.
[2023-03-22 15:08:03] [INFO ] Deduced a trap composed of 11 places in 1557 ms of which 1 ms to minimize.
[2023-03-22 15:08:04] [INFO ] Deduced a trap composed of 10 places in 482 ms of which 2 ms to minimize.
[2023-03-22 15:08:04] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 1 ms to minimize.
[2023-03-22 15:08:05] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 1 ms to minimize.
[2023-03-22 15:08:06] [INFO ] Deduced a trap composed of 10 places in 439 ms of which 1 ms to minimize.
[2023-03-22 15:08:06] [INFO ] Deduced a trap composed of 9 places in 475 ms of which 0 ms to minimize.
[2023-03-22 15:08:07] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 0 ms to minimize.
[2023-03-22 15:08:08] [INFO ] Deduced a trap composed of 10 places in 1039 ms of which 1 ms to minimize.
[2023-03-22 15:08:09] [INFO ] Deduced a trap composed of 13 places in 621 ms of which 1 ms to minimize.
[2023-03-22 15:08:09] [INFO ] Deduced a trap composed of 11 places in 531 ms of which 1 ms to minimize.
[2023-03-22 15:08:10] [INFO ] Deduced a trap composed of 14 places in 524 ms of which 1 ms to minimize.
[2023-03-22 15:08:11] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 1 ms to minimize.
[2023-03-22 15:08:12] [INFO ] Deduced a trap composed of 13 places in 646 ms of which 1 ms to minimize.
[2023-03-22 15:08:12] [INFO ] Deduced a trap composed of 10 places in 649 ms of which 1 ms to minimize.
[2023-03-22 15:08:13] [INFO ] Deduced a trap composed of 12 places in 445 ms of which 1 ms to minimize.
[2023-03-22 15:08:14] [INFO ] Deduced a trap composed of 13 places in 1093 ms of which 2 ms to minimize.
[2023-03-22 15:08:15] [INFO ] Deduced a trap composed of 10 places in 505 ms of which 1 ms to minimize.
[2023-03-22 15:08:15] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 1 ms to minimize.
[2023-03-22 15:08:16] [INFO ] Deduced a trap composed of 11 places in 587 ms of which 1 ms to minimize.
[2023-03-22 15:08:17] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2023-03-22 15:08:17] [INFO ] Deduced a trap composed of 13 places in 551 ms of which 1 ms to minimize.
[2023-03-22 15:08:18] [INFO ] Deduced a trap composed of 14 places in 595 ms of which 0 ms to minimize.
[2023-03-22 15:08:19] [INFO ] Deduced a trap composed of 13 places in 1071 ms of which 1 ms to minimize.
[2023-03-22 15:08:20] [INFO ] Deduced a trap composed of 15 places in 340 ms of which 1 ms to minimize.
[2023-03-22 15:08:20] [INFO ] Deduced a trap composed of 16 places in 391 ms of which 1 ms to minimize.
[2023-03-22 15:08:21] [INFO ] Deduced a trap composed of 12 places in 797 ms of which 1 ms to minimize.
[2023-03-22 15:08:22] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 1 ms to minimize.
[2023-03-22 15:08:22] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 1 ms to minimize.
[2023-03-22 15:08:23] [INFO ] Deduced a trap composed of 8 places in 413 ms of which 1 ms to minimize.
[2023-03-22 15:08:23] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2023-03-22 15:08:24] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-22 15:08:25] [INFO ] Deduced a trap composed of 14 places in 595 ms of which 0 ms to minimize.
[2023-03-22 15:08:25] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 1 ms to minimize.
[2023-03-22 15:08:26] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 0 ms to minimize.
[2023-03-22 15:08:26] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 2 ms to minimize.
[2023-03-22 15:08:27] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 1 ms to minimize.
[2023-03-22 15:08:27] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 1 ms to minimize.
[2023-03-22 15:08:28] [INFO ] Deduced a trap composed of 10 places in 446 ms of which 1 ms to minimize.
[2023-03-22 15:08:29] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 1 ms to minimize.
[2023-03-22 15:08:29] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 1 ms to minimize.
[2023-03-22 15:08:30] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 0 ms to minimize.
[2023-03-22 15:08:30] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 1 ms to minimize.
[2023-03-22 15:08:31] [INFO ] Deduced a trap composed of 18 places in 545 ms of which 1 ms to minimize.
[2023-03-22 15:08:31] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 0 ms to minimize.
[2023-03-22 15:08:32] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 1 ms to minimize.
[2023-03-22 15:08:32] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2023-03-22 15:08:33] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 0 ms to minimize.
[2023-03-22 15:08:33] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 38219 ms
[2023-03-22 15:08:34] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 1 ms to minimize.
[2023-03-22 15:08:35] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-22 15:08:35] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-22 15:08:36] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 0 ms to minimize.
[2023-03-22 15:08:36] [INFO ] Deduced a trap composed of 7 places in 607 ms of which 2 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 1 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-22 15:08:37] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 1 ms to minimize.
[2023-03-22 15:08:38] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-22 15:08:38] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2023-03-22 15:08:39] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-22 15:08:39] [INFO ] Deduced a trap composed of 7 places in 406 ms of which 1 ms to minimize.
[2023-03-22 15:08:40] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2023-03-22 15:08:41] [INFO ] Deduced a trap composed of 7 places in 1147 ms of which 0 ms to minimize.
[2023-03-22 15:08:41] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 0 ms to minimize.
[2023-03-22 15:08:42] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 0 ms to minimize.
[2023-03-22 15:08:42] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2023-03-22 15:08:43] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 1 ms to minimize.
[2023-03-22 15:08:43] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 1 ms to minimize.
[2023-03-22 15:08:44] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2023-03-22 15:08:44] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-22 15:08:44] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2023-03-22 15:08:45] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 0 ms to minimize.
[2023-03-22 15:08:46] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 1 ms to minimize.
[2023-03-22 15:08:46] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 1 ms to minimize.
[2023-03-22 15:08:46] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 0 ms to minimize.
[2023-03-22 15:08:47] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 0 ms to minimize.
[2023-03-22 15:08:47] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 0 ms to minimize.
[2023-03-22 15:08:48] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-22 15:08:48] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2023-03-22 15:08:48] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 14115 ms
[2023-03-22 15:08:49] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-03-22 15:08:49] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-22 15:08:49] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-22 15:08:50] [INFO ] Deduced a trap composed of 8 places in 509 ms of which 0 ms to minimize.
[2023-03-22 15:08:50] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2023-03-22 15:08:51] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2023-03-22 15:08:51] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2023-03-22 15:08:51] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 0 ms to minimize.
[2023-03-22 15:08:52] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2023-03-22 15:08:52] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-22 15:08:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4103 ms
[2023-03-22 15:08:53] [INFO ] After 126229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2271 ms.
[2023-03-22 15:08:55] [INFO ] After 129869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 15:08:55] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 15:08:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2613 places, 2514 transitions and 12346 arcs took 25 ms.
[2023-03-22 15:08:56] [INFO ] Flatten gal took : 266 ms
Total runtime 237341 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: ShieldIIPs_PT_100B
(NrP: 2613 NrTr: 2514 NrArc: 12346)

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

net check time: 0m 0.002sec

init dd package: 0m 3.077sec

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


initing FirstDep: 0m 0.033sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPs-PT-100B, 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 r394-oct2-167903717600175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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