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

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

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=ShieldIIPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:52:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:52:23] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2023-03-21 20:52:23] [INFO ] Transformed 6003 places.
[2023-03-21 20:52:23] [INFO ] Transformed 5903 transitions.
[2023-03-21 20:52:23] [INFO ] Found NUPN structural information;
[2023-03-21 20:52:23] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 589 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 713 ms. (steps per millisecond=14 ) properties (out of 16) seen :6
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-08 FALSE 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 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-21 20:52:25] [INFO ] Computed 901 place invariants in 87 ms
[2023-03-21 20:52:28] [INFO ] After 2661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 20:52:31] [INFO ] [Nat]Absence check using 901 positive place invariants in 1090 ms returned sat
[2023-03-21 20:52:53] [INFO ] After 20728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 20:52:53] [INFO ] After 20739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 20:52:53] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 324 ms.
Support contains 175 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 470 place count 6003 transition count 5433
Reduce places removed 470 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 477 rules applied. Total rules applied 947 place count 5533 transition count 5426
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 954 place count 5526 transition count 5426
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 954 place count 5526 transition count 4930
Deduced a syphon composed of 496 places in 31 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1946 place count 5030 transition count 4930
Discarding 675 places :
Symmetric choice reduction at 3 with 675 rule applications. Total rules 2621 place count 4355 transition count 4255
Iterating global reduction 3 with 675 rules applied. Total rules applied 3296 place count 4355 transition count 4255
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 3296 place count 4355 transition count 4003
Deduced a syphon composed of 252 places in 28 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 3800 place count 4103 transition count 4003
Performed 1444 Post agglomeration using F-continuation condition.Transition count delta: 1444
Deduced a syphon composed of 1444 places in 39 ms
Reduce places removed 1444 places and 0 transitions.
Iterating global reduction 3 with 2888 rules applied. Total rules applied 6688 place count 2659 transition count 2559
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 650 times.
Drop transitions removed 650 transitions
Iterating global reduction 3 with 650 rules applied. Total rules applied 7338 place count 2659 transition count 2559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7339 place count 2658 transition count 2558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7340 place count 2657 transition count 2558
Applied a total of 7340 rules in 2456 ms. Remains 2657 /6003 variables (removed 3346) and now considering 2558/5903 (removed 3345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2457 ms. Remains : 2657/6003 places, 2558/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 10) seen :4
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-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2558 rows 2657 cols
[2023-03-21 20:52:57] [INFO ] Computed 900 place invariants in 116 ms
[2023-03-21 20:52:57] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 20:52:58] [INFO ] [Nat]Absence check using 881 positive place invariants in 292 ms returned sat
[2023-03-21 20:52:58] [INFO ] [Nat]Absence check using 881 positive and 19 generalized place invariants in 19 ms returned sat
[2023-03-21 20:53:02] [INFO ] After 3712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 10 places in 625 ms of which 7 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 6 places in 650 ms of which 2 ms to minimize.
[2023-03-21 20:53:05] [INFO ] Deduced a trap composed of 6 places in 681 ms of which 1 ms to minimize.
[2023-03-21 20:53:06] [INFO ] Deduced a trap composed of 7 places in 809 ms of which 5 ms to minimize.
[2023-03-21 20:53:07] [INFO ] Deduced a trap composed of 5 places in 841 ms of which 16 ms to minimize.
[2023-03-21 20:53:08] [INFO ] Deduced a trap composed of 8 places in 557 ms of which 1 ms to minimize.
[2023-03-21 20:53:09] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 2 ms to minimize.
[2023-03-21 20:53:09] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 1 ms to minimize.
[2023-03-21 20:53:10] [INFO ] Deduced a trap composed of 10 places in 597 ms of which 1 ms to minimize.
[2023-03-21 20:53:11] [INFO ] Deduced a trap composed of 6 places in 534 ms of which 1 ms to minimize.
[2023-03-21 20:53:11] [INFO ] Deduced a trap composed of 7 places in 458 ms of which 1 ms to minimize.
[2023-03-21 20:53:12] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 1 ms to minimize.
[2023-03-21 20:53:13] [INFO ] Deduced a trap composed of 10 places in 994 ms of which 1 ms to minimize.
[2023-03-21 20:53:14] [INFO ] Deduced a trap composed of 7 places in 615 ms of which 2 ms to minimize.
[2023-03-21 20:53:15] [INFO ] Deduced a trap composed of 8 places in 566 ms of which 25 ms to minimize.
[2023-03-21 20:53:15] [INFO ] Deduced a trap composed of 10 places in 581 ms of which 13 ms to minimize.
[2023-03-21 20:53:16] [INFO ] Deduced a trap composed of 12 places in 594 ms of which 2 ms to minimize.
[2023-03-21 20:53:17] [INFO ] Deduced a trap composed of 15 places in 589 ms of which 1 ms to minimize.
[2023-03-21 20:53:17] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2023-03-21 20:53:18] [INFO ] Deduced a trap composed of 9 places in 432 ms of which 2 ms to minimize.
[2023-03-21 20:53:19] [INFO ] Deduced a trap composed of 6 places in 850 ms of which 3 ms to minimize.
[2023-03-21 20:53:20] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 17 ms to minimize.
[2023-03-21 20:53:20] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2023-03-21 20:53:21] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 1 ms to minimize.
[2023-03-21 20:53:21] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 1 ms to minimize.
[2023-03-21 20:53:22] [INFO ] Deduced a trap composed of 14 places in 485 ms of which 1 ms to minimize.
[2023-03-21 20:53:22] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 1 ms to minimize.
[2023-03-21 20:53:25] [INFO ] Deduced a trap composed of 13 places in 2470 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 20:53:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:53:25] [INFO ] After 27369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1267 ms.
Support contains 125 out of 2657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2657/2657 places, 2558/2558 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2657 transition count 2554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2653 transition count 2554
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 2653 transition count 2545
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 2644 transition count 2545
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 9 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 84 place count 2615 transition count 2516
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 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 100 place count 2613 transition count 2514
Applied a total of 100 rules in 653 ms. Remains 2613 /2657 variables (removed 44) and now considering 2514/2558 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 2613/2657 places, 2514/2558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) 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
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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 52653 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52653 steps, saw 50997 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2514 rows 2613 cols
[2023-03-21 20:53:31] [INFO ] Computed 900 place invariants in 66 ms
[2023-03-21 20:53:32] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 20:53:34] [INFO ] [Nat]Absence check using 886 positive place invariants in 757 ms returned sat
[2023-03-21 20:53:34] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 14 ms returned sat
[2023-03-21 20:53:39] [INFO ] After 4771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 20:53:40] [INFO ] Deduced a trap composed of 6 places in 613 ms of which 2 ms to minimize.
[2023-03-21 20:53:41] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 1 ms to minimize.
[2023-03-21 20:53:41] [INFO ] Deduced a trap composed of 9 places in 561 ms of which 1 ms to minimize.
[2023-03-21 20:53:42] [INFO ] Deduced a trap composed of 7 places in 538 ms of which 1 ms to minimize.
[2023-03-21 20:53:43] [INFO ] Deduced a trap composed of 9 places in 599 ms of which 2 ms to minimize.
[2023-03-21 20:53:43] [INFO ] Deduced a trap composed of 8 places in 489 ms of which 1 ms to minimize.
[2023-03-21 20:53:44] [INFO ] Deduced a trap composed of 11 places in 551 ms of which 1 ms to minimize.
[2023-03-21 20:53:45] [INFO ] Deduced a trap composed of 10 places in 526 ms of which 0 ms to minimize.
[2023-03-21 20:53:45] [INFO ] Deduced a trap composed of 10 places in 380 ms of which 1 ms to minimize.
[2023-03-21 20:53:46] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 1 ms to minimize.
[2023-03-21 20:53:46] [INFO ] Deduced a trap composed of 10 places in 412 ms of which 1 ms to minimize.
[2023-03-21 20:53:47] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 14 ms to minimize.
[2023-03-21 20:53:47] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 13 ms to minimize.
[2023-03-21 20:53:48] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 2 ms to minimize.
[2023-03-21 20:53:49] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-21 20:53:49] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-21 20:53:49] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 1 ms to minimize.
[2023-03-21 20:53:50] [INFO ] Deduced a trap composed of 9 places in 366 ms of which 0 ms to minimize.
[2023-03-21 20:53:50] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 0 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 1 ms to minimize.
[2023-03-21 20:53:53] [INFO ] Deduced a trap composed of 10 places in 1603 ms of which 2 ms to minimize.
[2023-03-21 20:53:53] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 12 ms to minimize.
[2023-03-21 20:53:54] [INFO ] Deduced a trap composed of 13 places in 672 ms of which 1 ms to minimize.
[2023-03-21 20:53:55] [INFO ] Deduced a trap composed of 14 places in 369 ms of which 1 ms to minimize.
[2023-03-21 20:53:55] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 0 ms to minimize.
[2023-03-21 20:53:56] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 1 ms to minimize.
[2023-03-21 20:53:56] [INFO ] Deduced a trap composed of 13 places in 709 ms of which 1 ms to minimize.
[2023-03-21 20:53:57] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 1 ms to minimize.
[2023-03-21 20:53:57] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 17763 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 20:53:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:53:57] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1407 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 92 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 92 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 132 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-21 20:53:59] [INFO ] Invariant cache hit.
[2023-03-21 20:54:01] [INFO ] Implicit Places using invariants in 2901 ms returned []
[2023-03-21 20:54:01] [INFO ] Invariant cache hit.
[2023-03-21 20:54:16] [INFO ] Implicit Places using invariants and state equation in 14161 ms returned []
Implicit Place search using SMT with State Equation took 17067 ms to find 0 implicit places.
[2023-03-21 20:54:16] [INFO ] Redundant transitions in 475 ms returned []
[2023-03-21 20:54:16] [INFO ] Invariant cache hit.
[2023-03-21 20:54:19] [INFO ] Dead Transitions using invariants and state equation in 3206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20894 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 96 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-21 20:54:19] [INFO ] Invariant cache hit.
[2023-03-21 20:54:20] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 20:54:21] [INFO ] [Nat]Absence check using 886 positive place invariants in 330 ms returned sat
[2023-03-21 20:54:21] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-21 20:54:25] [INFO ] After 3686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 20:54:26] [INFO ] Deduced a trap composed of 8 places in 574 ms of which 2 ms to minimize.
[2023-03-21 20:54:27] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 1 ms to minimize.
[2023-03-21 20:54:28] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 1 ms to minimize.
[2023-03-21 20:54:28] [INFO ] Deduced a trap composed of 9 places in 538 ms of which 1 ms to minimize.
[2023-03-21 20:54:29] [INFO ] Deduced a trap composed of 9 places in 450 ms of which 1 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 3 places in 1633 ms of which 1 ms to minimize.
[2023-03-21 20:54:33] [INFO ] Deduced a trap composed of 9 places in 2503 ms of which 1 ms to minimize.
[2023-03-21 20:54:34] [INFO ] Deduced a trap composed of 7 places in 439 ms of which 1 ms to minimize.
[2023-03-21 20:54:38] [INFO ] Deduced a trap composed of 7 places in 3693 ms of which 1 ms to minimize.
[2023-03-21 20:54:40] [INFO ] Deduced a trap composed of 11 places in 2609 ms of which 1 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 1 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 12 places in 614 ms of which 13 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 2 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Deduced a trap composed of 11 places in 1682 ms of which 1 ms to minimize.
[2023-03-21 20:54:45] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2023-03-21 20:54:46] [INFO ] Deduced a trap composed of 8 places in 540 ms of which 1 ms to minimize.
[2023-03-21 20:54:46] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-21 20:54:47] [INFO ] Deduced a trap composed of 11 places in 566 ms of which 1 ms to minimize.
[2023-03-21 20:54:47] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2023-03-21 20:54:48] [INFO ] Deduced a trap composed of 8 places in 522 ms of which 1 ms to minimize.
[2023-03-21 20:54:49] [INFO ] Deduced a trap composed of 10 places in 522 ms of which 1 ms to minimize.
[2023-03-21 20:54:49] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-21 20:54:50] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2023-03-21 20:54:50] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 1 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 0 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 2 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 1 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 13 places in 501 ms of which 1 ms to minimize.
[2023-03-21 20:54:54] [INFO ] Deduced a trap composed of 11 places in 616 ms of which 1 ms to minimize.
[2023-03-21 20:54:54] [INFO ] Deduced a trap composed of 20 places in 512 ms of which 1 ms to minimize.
[2023-03-21 20:54:55] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 12 ms to minimize.
[2023-03-21 20:54:56] [INFO ] Deduced a trap composed of 12 places in 987 ms of which 0 ms to minimize.
[2023-03-21 20:54:56] [INFO ] Deduced a trap composed of 9 places in 467 ms of which 1 ms to minimize.
[2023-03-21 20:54:57] [INFO ] Deduced a trap composed of 12 places in 819 ms of which 1 ms to minimize.
[2023-03-21 20:54:58] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 0 ms to minimize.
[2023-03-21 20:54:58] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 1 ms to minimize.
[2023-03-21 20:54:59] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 1 ms to minimize.
[2023-03-21 20:54:59] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 0 ms to minimize.
[2023-03-21 20:55:00] [INFO ] Deduced a trap composed of 6 places in 1076 ms of which 8 ms to minimize.
[2023-03-21 20:55:01] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 0 ms to minimize.
[2023-03-21 20:55:02] [INFO ] Deduced a trap composed of 15 places in 951 ms of which 1 ms to minimize.
[2023-03-21 20:55:03] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 12 places in 1447 ms of which 0 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:55:05] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2023-03-21 20:55:06] [INFO ] Deduced a trap composed of 18 places in 1221 ms of which 1 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 1 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 41818 ms
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 5 places in 1368 ms of which 1 ms to minimize.
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 1 ms to minimize.
[2023-03-21 20:55:11] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-21 20:55:12] [INFO ] Deduced a trap composed of 6 places in 596 ms of which 1 ms to minimize.
[2023-03-21 20:55:12] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 1 ms to minimize.
[2023-03-21 20:55:13] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 1 ms to minimize.
[2023-03-21 20:55:13] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2023-03-21 20:55:13] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:55:14] [INFO ] Deduced a trap composed of 17 places in 339 ms of which 1 ms to minimize.
[2023-03-21 20:55:14] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 1 ms to minimize.
[2023-03-21 20:55:15] [INFO ] Deduced a trap composed of 21 places in 694 ms of which 1 ms to minimize.
[2023-03-21 20:55:16] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 2 ms to minimize.
[2023-03-21 20:55:16] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 2 ms to minimize.
[2023-03-21 20:55:17] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 1 ms to minimize.
[2023-03-21 20:55:17] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 17 ms to minimize.
[2023-03-21 20:55:17] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 13 ms to minimize.
[2023-03-21 20:55:18] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 3 ms to minimize.
[2023-03-21 20:55:18] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-21 20:55:19] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-21 20:55:19] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 11325 ms
[2023-03-21 20:55:21] [INFO ] Deduced a trap composed of 14 places in 1766 ms of which 1 ms to minimize.
[2023-03-21 20:55:27] [INFO ] Deduced a trap composed of 8 places in 5495 ms of which 37 ms to minimize.
[2023-03-21 20:55:28] [INFO ] Deduced a trap composed of 16 places in 841 ms of which 2 ms to minimize.
[2023-03-21 20:55:30] [INFO ] Deduced a trap composed of 7 places in 1914 ms of which 2 ms to minimize.
[2023-03-21 20:55:31] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 1 ms to minimize.
[2023-03-21 20:55:31] [INFO ] Deduced a trap composed of 12 places in 473 ms of which 1 ms to minimize.
[2023-03-21 20:55:32] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 1 ms to minimize.
[2023-03-21 20:55:32] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 1 ms to minimize.
[2023-03-21 20:55:33] [INFO ] Deduced a trap composed of 13 places in 1063 ms of which 0 ms to minimize.
[2023-03-21 20:55:34] [INFO ] Deduced a trap composed of 9 places in 534 ms of which 2 ms to minimize.
[2023-03-21 20:55:35] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 1 ms to minimize.
[2023-03-21 20:55:36] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
[2023-03-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 0 ms to minimize.
[2023-03-21 20:55:37] [INFO ] Deduced a trap composed of 11 places in 550 ms of which 1 ms to minimize.
[2023-03-21 20:55:38] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 15 ms to minimize.
[2023-03-21 20:55:38] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-21 20:55:39] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 0 ms to minimize.
[2023-03-21 20:55:40] [INFO ] Deduced a trap composed of 10 places in 377 ms of which 1 ms to minimize.
[2023-03-21 20:55:40] [INFO ] Deduced a trap composed of 11 places in 579 ms of which 1 ms to minimize.
[2023-03-21 20:55:41] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 1 ms to minimize.
[2023-03-21 20:55:41] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 1 ms to minimize.
[2023-03-21 20:55:42] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
[2023-03-21 20:55:42] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 1 ms to minimize.
[2023-03-21 20:55:43] [INFO ] Deduced a trap composed of 16 places in 348 ms of which 1 ms to minimize.
[2023-03-21 20:55:43] [INFO ] Deduced a trap composed of 12 places in 590 ms of which 1 ms to minimize.
[2023-03-21 20:55:45] [INFO ] Deduced a trap composed of 19 places in 1502 ms of which 1 ms to minimize.
[2023-03-21 20:55:46] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 1 ms to minimize.
[2023-03-21 20:55:46] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 1 ms to minimize.
[2023-03-21 20:55:47] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 0 ms to minimize.
[2023-03-21 20:55:48] [INFO ] Deduced a trap composed of 17 places in 1055 ms of which 1 ms to minimize.
[2023-03-21 20:55:49] [INFO ] Deduced a trap composed of 20 places in 435 ms of which 1 ms to minimize.
[2023-03-21 20:55:49] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 1 ms to minimize.
[2023-03-21 20:55:50] [INFO ] Deduced a trap composed of 21 places in 444 ms of which 1 ms to minimize.
[2023-03-21 20:55:50] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2023-03-21 20:55:51] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2023-03-21 20:55:51] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 0 ms to minimize.
[2023-03-21 20:55:52] [INFO ] Deduced a trap composed of 21 places in 511 ms of which 1 ms to minimize.
[2023-03-21 20:55:53] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 1 ms to minimize.
[2023-03-21 20:55:53] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 0 ms to minimize.
[2023-03-21 20:55:53] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:55:54] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2023-03-21 20:55:54] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 0 ms to minimize.
[2023-03-21 20:55:55] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2023-03-21 20:55:55] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 1 ms to minimize.
[2023-03-21 20:55:56] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 1 ms to minimize.
[2023-03-21 20:55:56] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 0 ms to minimize.
[2023-03-21 20:55:57] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:55:57] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-21 20:55:58] [INFO ] Deduced a trap composed of 18 places in 745 ms of which 1 ms to minimize.
[2023-03-21 20:55:58] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 38876 ms
[2023-03-21 20:56:00] [INFO ] Deduced a trap composed of 7 places in 398 ms of which 1 ms to minimize.
[2023-03-21 20:56:00] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 1 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2023-03-21 20:56:02] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2023-03-21 20:56:02] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2023-03-21 20:56:03] [INFO ] Deduced a trap composed of 12 places in 451 ms of which 1 ms to minimize.
[2023-03-21 20:56:03] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 1 ms to minimize.
[2023-03-21 20:56:04] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-03-21 20:56:05] [INFO ] Deduced a trap composed of 12 places in 1617 ms of which 1 ms to minimize.
[2023-03-21 20:56:06] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 0 ms to minimize.
[2023-03-21 20:56:06] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:56:08] [INFO ] Deduced a trap composed of 14 places in 2190 ms of which 1 ms to minimize.
[2023-03-21 20:56:09] [INFO ] Deduced a trap composed of 17 places in 665 ms of which 1 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 0 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10672 ms
[2023-03-21 20:56:11] [INFO ] Deduced a trap composed of 22 places in 510 ms of which 1 ms to minimize.
[2023-03-21 20:56:11] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-21 20:56:11] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 0 ms to minimize.
[2023-03-21 20:56:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1362 ms
[2023-03-21 20:56:12] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2023-03-21 20:56:12] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 0 ms to minimize.
[2023-03-21 20:56:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 809 ms
[2023-03-21 20:56:12] [INFO ] After 110865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2747 ms.
[2023-03-21 20:56:15] [INFO ] After 114953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-21 20:56:15] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 29 ms.
[2023-03-21 20:56:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2613 places, 2514 transitions and 12346 arcs took 42 ms.
[2023-03-21 20:56:16] [INFO ] Flatten gal took : 338 ms
Total runtime 233085 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/1119/inv_0_ --invariant=/tmp/1119/inv_1_ --invariant=/tmp/1119/inv_2_ --invariant=/tmp/1119/inv_3_ --invariant=/tmp/1119/inv_4_ --invariant=/tmp/1119/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13342616 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095892 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
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
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 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 r393-oct2-167903716700175"
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 ;