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-167903717100527.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 ShieldPPPs-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-167903717100527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 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.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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.8M 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 ShieldPPPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679459122595

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=ShieldPPPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:25:25] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-22 04:25:25] [INFO ] Transformed 6803 places.
[2023-03-22 04:25:26] [INFO ] Transformed 6303 transitions.
[2023-03-22 04:25:26] [INFO ] Found NUPN structural information;
[2023-03-22 04:25:26] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 788 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-22 04:25:27] [INFO ] Computed 1101 place invariants in 72 ms
[2023-03-22 04:25:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1068 ms returned sat
[2023-03-22 04:25:31] [INFO ] After 4208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 04:25:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 853 ms returned sat
[2023-03-22 04:25:56] [INFO ] After 19732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 04:25:56] [INFO ] After 19750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 04:25:56] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 382 ms.
Support contains 275 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 6803 transition count 5670
Reduce places removed 633 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 655 rules applied. Total rules applied 1288 place count 6170 transition count 5648
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1310 place count 6148 transition count 5648
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 1310 place count 6148 transition count 5156
Deduced a syphon composed of 492 places in 26 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 2294 place count 5656 transition count 5156
Discarding 648 places :
Symmetric choice reduction at 3 with 648 rule applications. Total rules 2942 place count 5008 transition count 4508
Iterating global reduction 3 with 648 rules applied. Total rules applied 3590 place count 5008 transition count 4508
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 3590 place count 5008 transition count 4266
Deduced a syphon composed of 242 places in 26 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 4074 place count 4766 transition count 4266
Performed 1382 Post agglomeration using F-continuation condition.Transition count delta: 1382
Deduced a syphon composed of 1382 places in 22 ms
Reduce places removed 1382 places and 0 transitions.
Iterating global reduction 3 with 2764 rules applied. Total rules applied 6838 place count 3384 transition count 2884
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 820 times.
Drop transitions removed 820 transitions
Iterating global reduction 3 with 820 rules applied. Total rules applied 7658 place count 3384 transition count 2884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7659 place count 3383 transition count 2883
Applied a total of 7659 rules in 3110 ms. Remains 3383 /6803 variables (removed 3420) and now considering 2883/6303 (removed 3420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3111 ms. Remains : 3383/6803 places, 2883/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 10) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2883 rows 3383 cols
[2023-03-22 04:26:01] [INFO ] Computed 1101 place invariants in 112 ms
[2023-03-22 04:26:03] [INFO ] [Real]Absence check using 1053 positive place invariants in 373 ms returned sat
[2023-03-22 04:26:03] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 33 ms returned sat
[2023-03-22 04:26:03] [INFO ] After 1682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 04:26:04] [INFO ] [Nat]Absence check using 1053 positive place invariants in 351 ms returned sat
[2023-03-22 04:26:04] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-22 04:26:14] [INFO ] After 8508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 04:26:16] [INFO ] Deduced a trap composed of 5 places in 1601 ms of which 12 ms to minimize.
[2023-03-22 04:26:17] [INFO ] Deduced a trap composed of 9 places in 1024 ms of which 15 ms to minimize.
[2023-03-22 04:26:18] [INFO ] Deduced a trap composed of 7 places in 1005 ms of which 3 ms to minimize.
[2023-03-22 04:26:19] [INFO ] Deduced a trap composed of 5 places in 967 ms of which 14 ms to minimize.
[2023-03-22 04:26:20] [INFO ] Deduced a trap composed of 4 places in 919 ms of which 2 ms to minimize.
[2023-03-22 04:26:21] [INFO ] Deduced a trap composed of 4 places in 1019 ms of which 14 ms to minimize.
[2023-03-22 04:26:22] [INFO ] Deduced a trap composed of 9 places in 859 ms of which 2 ms to minimize.
[2023-03-22 04:26:23] [INFO ] Deduced a trap composed of 4 places in 910 ms of which 1 ms to minimize.
[2023-03-22 04:26:24] [INFO ] Deduced a trap composed of 6 places in 867 ms of which 1 ms to minimize.
[2023-03-22 04:26:25] [INFO ] Deduced a trap composed of 16 places in 931 ms of which 2 ms to minimize.
[2023-03-22 04:26:26] [INFO ] Deduced a trap composed of 6 places in 952 ms of which 2 ms to minimize.
[2023-03-22 04:26:28] [INFO ] Deduced a trap composed of 5 places in 916 ms of which 2 ms to minimize.
[2023-03-22 04:26:28] [INFO ] Deduced a trap composed of 22 places in 804 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 04:26:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:26:28] [INFO ] After 25537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1441 ms.
Support contains 274 out of 3383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3383/3383 places, 2883/2883 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3383 transition count 2882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3382 transition count 2882
Applied a total of 2 rules in 170 ms. Remains 3382 /3383 variables (removed 1) and now considering 2882/2883 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 3382/3383 places, 2882/2883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 54208 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54208 steps, saw 52292 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2882 rows 3382 cols
[2023-03-22 04:26:34] [INFO ] Computed 1101 place invariants in 23 ms
[2023-03-22 04:26:36] [INFO ] [Real]Absence check using 1046 positive place invariants in 496 ms returned sat
[2023-03-22 04:26:36] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-22 04:26:36] [INFO ] After 1562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 04:26:37] [INFO ] [Nat]Absence check using 1046 positive place invariants in 332 ms returned sat
[2023-03-22 04:26:37] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 38 ms returned sat
[2023-03-22 04:26:49] [INFO ] After 10241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 04:26:50] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 3 ms to minimize.
[2023-03-22 04:26:51] [INFO ] Deduced a trap composed of 12 places in 869 ms of which 1 ms to minimize.
[2023-03-22 04:26:52] [INFO ] Deduced a trap composed of 9 places in 867 ms of which 2 ms to minimize.
[2023-03-22 04:26:53] [INFO ] Deduced a trap composed of 7 places in 926 ms of which 1 ms to minimize.
[2023-03-22 04:26:54] [INFO ] Deduced a trap composed of 7 places in 885 ms of which 2 ms to minimize.
[2023-03-22 04:26:55] [INFO ] Deduced a trap composed of 11 places in 969 ms of which 13 ms to minimize.
[2023-03-22 04:26:56] [INFO ] Deduced a trap composed of 8 places in 846 ms of which 1 ms to minimize.
[2023-03-22 04:26:57] [INFO ] Deduced a trap composed of 8 places in 962 ms of which 2 ms to minimize.
[2023-03-22 04:26:58] [INFO ] Deduced a trap composed of 9 places in 874 ms of which 14 ms to minimize.
[2023-03-22 04:26:59] [INFO ] Deduced a trap composed of 8 places in 802 ms of which 2 ms to minimize.
[2023-03-22 04:27:00] [INFO ] Deduced a trap composed of 6 places in 870 ms of which 2 ms to minimize.
[2023-03-22 04:27:01] [INFO ] Deduced a trap composed of 9 places in 726 ms of which 1 ms to minimize.
[2023-03-22 04:27:02] [INFO ] Deduced a trap composed of 15 places in 910 ms of which 2 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 04:27:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:27:02] [INFO ] After 25785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1506 ms.
Support contains 274 out of 3382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 204 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 242 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
[2023-03-22 04:27:04] [INFO ] Invariant cache hit.
[2023-03-22 04:27:07] [INFO ] Implicit Places using invariants in 3164 ms returned []
[2023-03-22 04:27:07] [INFO ] Invariant cache hit.
[2023-03-22 04:27:11] [INFO ] Implicit Places using invariants and state equation in 4327 ms returned []
Implicit Place search using SMT with State Equation took 7510 ms to find 0 implicit places.
[2023-03-22 04:27:11] [INFO ] Redundant transitions in 257 ms returned []
[2023-03-22 04:27:11] [INFO ] Invariant cache hit.
[2023-03-22 04:27:14] [INFO ] Dead Transitions using invariants and state equation in 2980 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11021 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 170 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-22 04:27:15] [INFO ] Invariant cache hit.
[2023-03-22 04:27:16] [INFO ] [Real]Absence check using 1046 positive place invariants in 321 ms returned sat
[2023-03-22 04:27:16] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-22 04:27:16] [INFO ] After 1701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 04:27:18] [INFO ] [Nat]Absence check using 1046 positive place invariants in 358 ms returned sat
[2023-03-22 04:27:18] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 27 ms returned sat
[2023-03-22 04:27:27] [INFO ] After 8794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 04:27:29] [INFO ] Deduced a trap composed of 4 places in 955 ms of which 5 ms to minimize.
[2023-03-22 04:27:30] [INFO ] Deduced a trap composed of 6 places in 1144 ms of which 2 ms to minimize.
[2023-03-22 04:27:31] [INFO ] Deduced a trap composed of 8 places in 1019 ms of which 1 ms to minimize.
[2023-03-22 04:27:32] [INFO ] Deduced a trap composed of 4 places in 949 ms of which 2 ms to minimize.
[2023-03-22 04:27:33] [INFO ] Deduced a trap composed of 5 places in 906 ms of which 2 ms to minimize.
[2023-03-22 04:27:34] [INFO ] Deduced a trap composed of 7 places in 816 ms of which 2 ms to minimize.
[2023-03-22 04:27:35] [INFO ] Deduced a trap composed of 9 places in 867 ms of which 2 ms to minimize.
[2023-03-22 04:27:36] [INFO ] Deduced a trap composed of 6 places in 957 ms of which 3 ms to minimize.
[2023-03-22 04:27:37] [INFO ] Deduced a trap composed of 6 places in 938 ms of which 2 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 4 places in 809 ms of which 2 ms to minimize.
[2023-03-22 04:27:39] [INFO ] Deduced a trap composed of 10 places in 1010 ms of which 2 ms to minimize.
[2023-03-22 04:27:40] [INFO ] Deduced a trap composed of 8 places in 879 ms of which 2 ms to minimize.
[2023-03-22 04:27:42] [INFO ] Deduced a trap composed of 13 places in 1036 ms of which 2 ms to minimize.
[2023-03-22 04:27:43] [INFO ] Deduced a trap composed of 10 places in 973 ms of which 7 ms to minimize.
[2023-03-22 04:27:44] [INFO ] Deduced a trap composed of 8 places in 894 ms of which 1 ms to minimize.
[2023-03-22 04:27:45] [INFO ] Deduced a trap composed of 11 places in 926 ms of which 2 ms to minimize.
[2023-03-22 04:27:46] [INFO ] Deduced a trap composed of 9 places in 917 ms of which 15 ms to minimize.
[2023-03-22 04:27:47] [INFO ] Deduced a trap composed of 8 places in 808 ms of which 15 ms to minimize.
[2023-03-22 04:27:48] [INFO ] Deduced a trap composed of 5 places in 759 ms of which 1 ms to minimize.
[2023-03-22 04:27:49] [INFO ] Deduced a trap composed of 26 places in 910 ms of which 1 ms to minimize.
[2023-03-22 04:27:50] [INFO ] Deduced a trap composed of 5 places in 847 ms of which 1 ms to minimize.
[2023-03-22 04:27:51] [INFO ] Deduced a trap composed of 7 places in 890 ms of which 2 ms to minimize.
[2023-03-22 04:27:52] [INFO ] Deduced a trap composed of 15 places in 872 ms of which 2 ms to minimize.
[2023-03-22 04:27:53] [INFO ] Deduced a trap composed of 5 places in 1018 ms of which 2 ms to minimize.
[2023-03-22 04:27:54] [INFO ] Deduced a trap composed of 7 places in 1023 ms of which 2 ms to minimize.
[2023-03-22 04:27:56] [INFO ] Deduced a trap composed of 4 places in 947 ms of which 2 ms to minimize.
[2023-03-22 04:27:57] [INFO ] Deduced a trap composed of 4 places in 1004 ms of which 2 ms to minimize.
[2023-03-22 04:27:58] [INFO ] Deduced a trap composed of 6 places in 1069 ms of which 2 ms to minimize.
[2023-03-22 04:27:59] [INFO ] Deduced a trap composed of 6 places in 1134 ms of which 2 ms to minimize.
[2023-03-22 04:28:00] [INFO ] Deduced a trap composed of 4 places in 1088 ms of which 31 ms to minimize.
[2023-03-22 04:28:02] [INFO ] Deduced a trap composed of 5 places in 980 ms of which 2 ms to minimize.
[2023-03-22 04:28:03] [INFO ] Deduced a trap composed of 4 places in 1090 ms of which 2 ms to minimize.
[2023-03-22 04:28:04] [INFO ] Deduced a trap composed of 12 places in 1467 ms of which 2 ms to minimize.
[2023-03-22 04:28:06] [INFO ] Deduced a trap composed of 13 places in 1101 ms of which 2 ms to minimize.
[2023-03-22 04:28:07] [INFO ] Deduced a trap composed of 17 places in 956 ms of which 1 ms to minimize.
[2023-03-22 04:28:08] [INFO ] Deduced a trap composed of 21 places in 1010 ms of which 2 ms to minimize.
[2023-03-22 04:28:09] [INFO ] Deduced a trap composed of 15 places in 922 ms of which 2 ms to minimize.
[2023-03-22 04:28:10] [INFO ] Deduced a trap composed of 14 places in 893 ms of which 28 ms to minimize.
[2023-03-22 04:28:11] [INFO ] Deduced a trap composed of 15 places in 997 ms of which 4 ms to minimize.
[2023-03-22 04:28:12] [INFO ] Deduced a trap composed of 24 places in 899 ms of which 2 ms to minimize.
[2023-03-22 04:28:13] [INFO ] Deduced a trap composed of 14 places in 939 ms of which 5 ms to minimize.
[2023-03-22 04:28:14] [INFO ] Deduced a trap composed of 12 places in 879 ms of which 15 ms to minimize.
[2023-03-22 04:28:16] [INFO ] Deduced a trap composed of 14 places in 1024 ms of which 1 ms to minimize.
[2023-03-22 04:28:17] [INFO ] Deduced a trap composed of 14 places in 863 ms of which 2 ms to minimize.
[2023-03-22 04:28:18] [INFO ] Deduced a trap composed of 16 places in 916 ms of which 2 ms to minimize.
[2023-03-22 04:28:19] [INFO ] Deduced a trap composed of 15 places in 897 ms of which 2 ms to minimize.
[2023-03-22 04:28:20] [INFO ] Deduced a trap composed of 18 places in 928 ms of which 2 ms to minimize.
[2023-03-22 04:28:21] [INFO ] Deduced a trap composed of 15 places in 916 ms of which 1 ms to minimize.
[2023-03-22 04:28:22] [INFO ] Deduced a trap composed of 13 places in 801 ms of which 2 ms to minimize.
[2023-03-22 04:28:23] [INFO ] Deduced a trap composed of 13 places in 806 ms of which 2 ms to minimize.
[2023-03-22 04:28:24] [INFO ] Deduced a trap composed of 13 places in 860 ms of which 2 ms to minimize.
[2023-03-22 04:28:25] [INFO ] Deduced a trap composed of 14 places in 767 ms of which 2 ms to minimize.
[2023-03-22 04:28:26] [INFO ] Deduced a trap composed of 24 places in 874 ms of which 2 ms to minimize.
[2023-03-22 04:28:27] [INFO ] Deduced a trap composed of 14 places in 798 ms of which 2 ms to minimize.
[2023-03-22 04:28:28] [INFO ] Deduced a trap composed of 17 places in 976 ms of which 2 ms to minimize.
[2023-03-22 04:28:29] [INFO ] Deduced a trap composed of 15 places in 808 ms of which 2 ms to minimize.
[2023-03-22 04:28:30] [INFO ] Deduced a trap composed of 16 places in 1030 ms of which 2 ms to minimize.
[2023-03-22 04:28:31] [INFO ] Deduced a trap composed of 10 places in 961 ms of which 2 ms to minimize.
[2023-03-22 04:28:32] [INFO ] Deduced a trap composed of 15 places in 862 ms of which 1 ms to minimize.
[2023-03-22 04:28:33] [INFO ] Deduced a trap composed of 17 places in 811 ms of which 2 ms to minimize.
[2023-03-22 04:28:34] [INFO ] Deduced a trap composed of 15 places in 841 ms of which 1 ms to minimize.
[2023-03-22 04:28:35] [INFO ] Deduced a trap composed of 16 places in 1002 ms of which 4 ms to minimize.
[2023-03-22 04:28:36] [INFO ] Deduced a trap composed of 15 places in 830 ms of which 2 ms to minimize.
[2023-03-22 04:28:37] [INFO ] Deduced a trap composed of 13 places in 925 ms of which 1 ms to minimize.
[2023-03-22 04:28:38] [INFO ] Deduced a trap composed of 13 places in 885 ms of which 1 ms to minimize.
[2023-03-22 04:28:39] [INFO ] Deduced a trap composed of 15 places in 812 ms of which 2 ms to minimize.
[2023-03-22 04:28:40] [INFO ] Deduced a trap composed of 15 places in 915 ms of which 1 ms to minimize.
[2023-03-22 04:28:41] [INFO ] Deduced a trap composed of 15 places in 1014 ms of which 2 ms to minimize.
[2023-03-22 04:28:42] [INFO ] Deduced a trap composed of 15 places in 819 ms of which 2 ms to minimize.
[2023-03-22 04:28:44] [INFO ] Deduced a trap composed of 20 places in 889 ms of which 2 ms to minimize.
[2023-03-22 04:28:45] [INFO ] Deduced a trap composed of 18 places in 949 ms of which 2 ms to minimize.
[2023-03-22 04:28:45] [INFO ] Deduced a trap composed of 26 places in 773 ms of which 1 ms to minimize.
[2023-03-22 04:28:46] [INFO ] Deduced a trap composed of 15 places in 666 ms of which 1 ms to minimize.
[2023-03-22 04:28:47] [INFO ] Deduced a trap composed of 16 places in 952 ms of which 2 ms to minimize.
[2023-03-22 04:28:48] [INFO ] Deduced a trap composed of 14 places in 700 ms of which 2 ms to minimize.
[2023-03-22 04:28:49] [INFO ] Deduced a trap composed of 18 places in 728 ms of which 1 ms to minimize.
[2023-03-22 04:28:50] [INFO ] Deduced a trap composed of 15 places in 756 ms of which 1 ms to minimize.
[2023-03-22 04:28:51] [INFO ] Deduced a trap composed of 29 places in 805 ms of which 2 ms to minimize.
[2023-03-22 04:28:52] [INFO ] Deduced a trap composed of 16 places in 789 ms of which 2 ms to minimize.
[2023-03-22 04:28:53] [INFO ] Deduced a trap composed of 29 places in 876 ms of which 2 ms to minimize.
[2023-03-22 04:28:54] [INFO ] Deduced a trap composed of 28 places in 882 ms of which 1 ms to minimize.
[2023-03-22 04:28:55] [INFO ] Deduced a trap composed of 15 places in 851 ms of which 1 ms to minimize.
[2023-03-22 04:28:56] [INFO ] Deduced a trap composed of 21 places in 772 ms of which 2 ms to minimize.
[2023-03-22 04:28:57] [INFO ] Deduced a trap composed of 41 places in 765 ms of which 2 ms to minimize.
[2023-03-22 04:28:57] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 89587 ms
[2023-03-22 04:28:59] [INFO ] Deduced a trap composed of 4 places in 909 ms of which 3 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 1 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 7 places in 754 ms of which 1 ms to minimize.
[2023-03-22 04:29:02] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
[2023-03-22 04:29:03] [INFO ] Deduced a trap composed of 5 places in 700 ms of which 2 ms to minimize.
[2023-03-22 04:29:04] [INFO ] Deduced a trap composed of 8 places in 755 ms of which 1 ms to minimize.
[2023-03-22 04:29:05] [INFO ] Deduced a trap composed of 4 places in 809 ms of which 1 ms to minimize.
[2023-03-22 04:29:05] [INFO ] Deduced a trap composed of 11 places in 651 ms of which 2 ms to minimize.
[2023-03-22 04:29:06] [INFO ] Deduced a trap composed of 12 places in 740 ms of which 2 ms to minimize.
[2023-03-22 04:29:07] [INFO ] Deduced a trap composed of 6 places in 754 ms of which 2 ms to minimize.
[2023-03-22 04:29:08] [INFO ] Deduced a trap composed of 10 places in 572 ms of which 1 ms to minimize.
[2023-03-22 04:29:09] [INFO ] Deduced a trap composed of 9 places in 631 ms of which 1 ms to minimize.
[2023-03-22 04:29:09] [INFO ] Deduced a trap composed of 7 places in 687 ms of which 14 ms to minimize.
[2023-03-22 04:29:10] [INFO ] Deduced a trap composed of 6 places in 702 ms of which 1 ms to minimize.
[2023-03-22 04:29:11] [INFO ] Deduced a trap composed of 7 places in 751 ms of which 1 ms to minimize.
[2023-03-22 04:29:12] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2023-03-22 04:29:13] [INFO ] Deduced a trap composed of 10 places in 815 ms of which 2 ms to minimize.
[2023-03-22 04:29:14] [INFO ] Deduced a trap composed of 6 places in 713 ms of which 1 ms to minimize.
[2023-03-22 04:29:15] [INFO ] Deduced a trap composed of 9 places in 576 ms of which 2 ms to minimize.
[2023-03-22 04:29:16] [INFO ] Deduced a trap composed of 6 places in 761 ms of which 1 ms to minimize.
[2023-03-22 04:29:17] [INFO ] Deduced a trap composed of 13 places in 716 ms of which 26 ms to minimize.
[2023-03-22 04:29:17] [INFO ] Deduced a trap composed of 13 places in 752 ms of which 2 ms to minimize.
[2023-03-22 04:29:18] [INFO ] Deduced a trap composed of 20 places in 481 ms of which 1 ms to minimize.
[2023-03-22 04:29:19] [INFO ] Deduced a trap composed of 10 places in 635 ms of which 1 ms to minimize.
[2023-03-22 04:29:19] [INFO ] Deduced a trap composed of 9 places in 496 ms of which 1 ms to minimize.
[2023-03-22 04:29:20] [INFO ] Deduced a trap composed of 21 places in 686 ms of which 2 ms to minimize.
[2023-03-22 04:29:21] [INFO ] Deduced a trap composed of 13 places in 574 ms of which 1 ms to minimize.
[2023-03-22 04:29:22] [INFO ] Deduced a trap composed of 13 places in 555 ms of which 1 ms to minimize.
[2023-03-22 04:29:22] [INFO ] Deduced a trap composed of 13 places in 573 ms of which 2 ms to minimize.
[2023-03-22 04:29:23] [INFO ] Deduced a trap composed of 13 places in 594 ms of which 1 ms to minimize.
[2023-03-22 04:29:24] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 2 ms to minimize.
[2023-03-22 04:29:24] [INFO ] Deduced a trap composed of 19 places in 511 ms of which 2 ms to minimize.
[2023-03-22 04:29:25] [INFO ] Deduced a trap composed of 17 places in 580 ms of which 1 ms to minimize.
[2023-03-22 04:29:26] [INFO ] Deduced a trap composed of 16 places in 587 ms of which 1 ms to minimize.
[2023-03-22 04:29:26] [INFO ] Deduced a trap composed of 14 places in 509 ms of which 1 ms to minimize.
[2023-03-22 04:29:27] [INFO ] Deduced a trap composed of 15 places in 547 ms of which 1 ms to minimize.
[2023-03-22 04:29:28] [INFO ] Deduced a trap composed of 26 places in 585 ms of which 1 ms to minimize.
[2023-03-22 04:29:29] [INFO ] Deduced a trap composed of 19 places in 615 ms of which 1 ms to minimize.
[2023-03-22 04:29:29] [INFO ] Deduced a trap composed of 29 places in 589 ms of which 1 ms to minimize.
[2023-03-22 04:29:30] [INFO ] Deduced a trap composed of 31 places in 571 ms of which 1 ms to minimize.
[2023-03-22 04:29:31] [INFO ] Deduced a trap composed of 23 places in 527 ms of which 1 ms to minimize.
[2023-03-22 04:29:32] [INFO ] Deduced a trap composed of 11 places in 774 ms of which 1 ms to minimize.
[2023-03-22 04:29:32] [INFO ] Deduced a trap composed of 13 places in 642 ms of which 2 ms to minimize.
[2023-03-22 04:29:33] [INFO ] Deduced a trap composed of 30 places in 553 ms of which 1 ms to minimize.
[2023-03-22 04:29:34] [INFO ] Deduced a trap composed of 14 places in 578 ms of which 1 ms to minimize.
[2023-03-22 04:29:35] [INFO ] Deduced a trap composed of 34 places in 480 ms of which 1 ms to minimize.
[2023-03-22 04:29:35] [INFO ] Deduced a trap composed of 41 places in 537 ms of which 1 ms to minimize.
[2023-03-22 04:29:36] [INFO ] Deduced a trap composed of 8 places in 524 ms of which 1 ms to minimize.
[2023-03-22 04:29:37] [INFO ] Deduced a trap composed of 13 places in 834 ms of which 1 ms to minimize.
[2023-03-22 04:29:38] [INFO ] Deduced a trap composed of 12 places in 564 ms of which 1 ms to minimize.
[2023-03-22 04:29:38] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 1 ms to minimize.
[2023-03-22 04:29:39] [INFO ] Deduced a trap composed of 11 places in 451 ms of which 1 ms to minimize.
[2023-03-22 04:29:39] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 41392 ms
[2023-03-22 04:29:44] [INFO ] Deduced a trap composed of 8 places in 582 ms of which 1 ms to minimize.
[2023-03-22 04:29:46] [INFO ] Deduced a trap composed of 6 places in 677 ms of which 1 ms to minimize.
[2023-03-22 04:29:46] [INFO ] Deduced a trap composed of 8 places in 485 ms of which 1 ms to minimize.
[2023-03-22 04:29:47] [INFO ] Deduced a trap composed of 6 places in 551 ms of which 2 ms to minimize.
[2023-03-22 04:29:47] [INFO ] Deduced a trap composed of 6 places in 491 ms of which 1 ms to minimize.
[2023-03-22 04:29:48] [INFO ] Deduced a trap composed of 5 places in 416 ms of which 0 ms to minimize.
[2023-03-22 04:29:49] [INFO ] Deduced a trap composed of 12 places in 497 ms of which 4 ms to minimize.
[2023-03-22 04:29:50] [INFO ] Deduced a trap composed of 12 places in 513 ms of which 1 ms to minimize.
[2023-03-22 04:29:50] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 1 ms to minimize.
[2023-03-22 04:29:51] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 1 ms to minimize.
[2023-03-22 04:29:51] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:29:52] [INFO ] Deduced a trap composed of 7 places in 422 ms of which 1 ms to minimize.
[2023-03-22 04:29:52] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2023-03-22 04:29:53] [INFO ] Deduced a trap composed of 8 places in 618 ms of which 1 ms to minimize.
[2023-03-22 04:29:54] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2023-03-22 04:29:54] [INFO ] Deduced a trap composed of 10 places in 386 ms of which 14 ms to minimize.
[2023-03-22 04:29:55] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 1 ms to minimize.
[2023-03-22 04:29:56] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 1 ms to minimize.
[2023-03-22 04:29:56] [INFO ] Deduced a trap composed of 8 places in 543 ms of which 5 ms to minimize.
[2023-03-22 04:29:57] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 1 ms to minimize.
[2023-03-22 04:29:57] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 2 ms to minimize.
[2023-03-22 04:29:58] [INFO ] Deduced a trap composed of 7 places in 471 ms of which 1 ms to minimize.
[2023-03-22 04:29:59] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 1 ms to minimize.
[2023-03-22 04:29:59] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 0 ms to minimize.
[2023-03-22 04:30:00] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2023-03-22 04:30:00] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2023-03-22 04:30:01] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 0 ms to minimize.
[2023-03-22 04:30:01] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 1 ms to minimize.
[2023-03-22 04:30:02] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 1 ms to minimize.
[2023-03-22 04:30:02] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-22 04:30:03] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 0 ms to minimize.
[2023-03-22 04:30:03] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 3 ms to minimize.
[2023-03-22 04:30:04] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2023-03-22 04:30:04] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 0 ms to minimize.
[2023-03-22 04:30:05] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 1 ms to minimize.
[2023-03-22 04:30:05] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 0 ms to minimize.
[2023-03-22 04:30:06] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 0 ms to minimize.
[2023-03-22 04:30:06] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 0 ms to minimize.
[2023-03-22 04:30:07] [INFO ] Deduced a trap composed of 15 places in 512 ms of which 1 ms to minimize.
[2023-03-22 04:30:07] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2023-03-22 04:30:08] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2023-03-22 04:30:08] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 0 ms to minimize.
[2023-03-22 04:30:09] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 0 ms to minimize.
[2023-03-22 04:30:09] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 0 ms to minimize.
[2023-03-22 04:30:09] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 25933 ms
[2023-03-22 04:30:11] [INFO ] Deduced a trap composed of 28 places in 559 ms of which 2 ms to minimize.
[2023-03-22 04:30:11] [INFO ] Deduced a trap composed of 17 places in 733 ms of which 1 ms to minimize.
[2023-03-22 04:30:12] [INFO ] Deduced a trap composed of 17 places in 720 ms of which 2 ms to minimize.
[2023-03-22 04:30:13] [INFO ] Deduced a trap composed of 12 places in 518 ms of which 1 ms to minimize.
[2023-03-22 04:30:14] [INFO ] Deduced a trap composed of 5 places in 971 ms of which 1 ms to minimize.
[2023-03-22 04:30:15] [INFO ] Deduced a trap composed of 13 places in 572 ms of which 1 ms to minimize.
[2023-03-22 04:30:16] [INFO ] Deduced a trap composed of 12 places in 527 ms of which 1 ms to minimize.
[2023-03-22 04:30:16] [INFO ] Deduced a trap composed of 9 places in 635 ms of which 1 ms to minimize.
[2023-03-22 04:30:17] [INFO ] Deduced a trap composed of 11 places in 489 ms of which 1 ms to minimize.
[2023-03-22 04:30:18] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 1 ms to minimize.
[2023-03-22 04:30:18] [INFO ] Deduced a trap composed of 8 places in 540 ms of which 1 ms to minimize.
[2023-03-22 04:30:19] [INFO ] Deduced a trap composed of 14 places in 457 ms of which 1 ms to minimize.
[2023-03-22 04:30:19] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 1 ms to minimize.
[2023-03-22 04:30:20] [INFO ] Deduced a trap composed of 13 places in 679 ms of which 1 ms to minimize.
[2023-03-22 04:30:21] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 2 ms to minimize.
[2023-03-22 04:30:22] [INFO ] Deduced a trap composed of 13 places in 607 ms of which 4 ms to minimize.
[2023-03-22 04:30:23] [INFO ] Deduced a trap composed of 18 places in 509 ms of which 1 ms to minimize.
[2023-03-22 04:30:23] [INFO ] Deduced a trap composed of 9 places in 473 ms of which 1 ms to minimize.
[2023-03-22 04:30:24] [INFO ] Deduced a trap composed of 7 places in 476 ms of which 1 ms to minimize.
[2023-03-22 04:30:24] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 0 ms to minimize.
[2023-03-22 04:30:25] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 1 ms to minimize.
[2023-03-22 04:30:26] [INFO ] Deduced a trap composed of 29 places in 526 ms of which 1 ms to minimize.
[2023-03-22 04:30:26] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 1 ms to minimize.
[2023-03-22 04:30:27] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 1 ms to minimize.
[2023-03-22 04:30:28] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 1 ms to minimize.
[2023-03-22 04:30:28] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 1 ms to minimize.
[2023-03-22 04:30:29] [INFO ] Deduced a trap composed of 18 places in 598 ms of which 1 ms to minimize.
[2023-03-22 04:30:30] [INFO ] Deduced a trap composed of 14 places in 438 ms of which 1 ms to minimize.
[2023-03-22 04:30:30] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 0 ms to minimize.
[2023-03-22 04:30:31] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-22 04:30:31] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 0 ms to minimize.
[2023-03-22 04:30:32] [INFO ] Deduced a trap composed of 16 places in 416 ms of which 1 ms to minimize.
[2023-03-22 04:30:32] [INFO ] Deduced a trap composed of 13 places in 447 ms of which 1 ms to minimize.
[2023-03-22 04:30:33] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 1 ms to minimize.
[2023-03-22 04:30:34] [INFO ] Deduced a trap composed of 10 places in 499 ms of which 1 ms to minimize.
[2023-03-22 04:30:34] [INFO ] Deduced a trap composed of 34 places in 397 ms of which 1 ms to minimize.
[2023-03-22 04:30:35] [INFO ] Deduced a trap composed of 27 places in 552 ms of which 1 ms to minimize.
[2023-03-22 04:30:36] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 0 ms to minimize.
[2023-03-22 04:30:36] [INFO ] Deduced a trap composed of 26 places in 331 ms of which 1 ms to minimize.
[2023-03-22 04:30:37] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2023-03-22 04:30:37] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 0 ms to minimize.
[2023-03-22 04:30:37] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 1 ms to minimize.
[2023-03-22 04:30:38] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 1 ms to minimize.
[2023-03-22 04:30:38] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
[2023-03-22 04:30:39] [INFO ] Deduced a trap composed of 19 places in 457 ms of which 1 ms to minimize.
[2023-03-22 04:30:40] [INFO ] Deduced a trap composed of 26 places in 475 ms of which 1 ms to minimize.
[2023-03-22 04:30:40] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 29792 ms
[2023-03-22 04:30:42] [INFO ] Deduced a trap composed of 5 places in 788 ms of which 1 ms to minimize.
[2023-03-22 04:30:43] [INFO ] Deduced a trap composed of 13 places in 644 ms of which 1 ms to minimize.
[2023-03-22 04:30:44] [INFO ] Deduced a trap composed of 11 places in 606 ms of which 35 ms to minimize.
[2023-03-22 04:30:44] [INFO ] Deduced a trap composed of 9 places in 740 ms of which 24 ms to minimize.
[2023-03-22 04:30:45] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 1 ms to minimize.
[2023-03-22 04:30:46] [INFO ] Deduced a trap composed of 9 places in 524 ms of which 1 ms to minimize.
[2023-03-22 04:30:47] [INFO ] Deduced a trap composed of 8 places in 790 ms of which 1 ms to minimize.
[2023-03-22 04:30:48] [INFO ] Deduced a trap composed of 14 places in 555 ms of which 1 ms to minimize.
[2023-03-22 04:30:48] [INFO ] Deduced a trap composed of 10 places in 618 ms of which 1 ms to minimize.
[2023-03-22 04:30:49] [INFO ] Deduced a trap composed of 13 places in 552 ms of which 1 ms to minimize.
[2023-03-22 04:30:50] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 1 ms to minimize.
[2023-03-22 04:30:51] [INFO ] Deduced a trap composed of 14 places in 568 ms of which 2 ms to minimize.
[2023-03-22 04:30:51] [INFO ] Deduced a trap composed of 9 places in 677 ms of which 1 ms to minimize.
[2023-03-22 04:30:52] [INFO ] Deduced a trap composed of 6 places in 706 ms of which 1 ms to minimize.
[2023-03-22 04:30:53] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 1 ms to minimize.
[2023-03-22 04:30:54] [INFO ] Deduced a trap composed of 15 places in 776 ms of which 2 ms to minimize.
[2023-03-22 04:30:55] [INFO ] Deduced a trap composed of 8 places in 466 ms of which 2 ms to minimize.
[2023-03-22 04:30:56] [INFO ] Deduced a trap composed of 15 places in 538 ms of which 1 ms to minimize.
[2023-03-22 04:30:56] [INFO ] Deduced a trap composed of 14 places in 440 ms of which 1 ms to minimize.
[2023-03-22 04:30:57] [INFO ] Deduced a trap composed of 10 places in 373 ms of which 1 ms to minimize.
[2023-03-22 04:30:57] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 1 ms to minimize.
[2023-03-22 04:30:58] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 1 ms to minimize.
[2023-03-22 04:30:59] [INFO ] Deduced a trap composed of 9 places in 532 ms of which 1 ms to minimize.
[2023-03-22 04:30:59] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 1 ms to minimize.
[2023-03-22 04:31:00] [INFO ] Deduced a trap composed of 16 places in 467 ms of which 1 ms to minimize.
[2023-03-22 04:31:00] [INFO ] Deduced a trap composed of 16 places in 480 ms of which 0 ms to minimize.
[2023-03-22 04:31:01] [INFO ] Deduced a trap composed of 14 places in 586 ms of which 1 ms to minimize.
[2023-03-22 04:31:02] [INFO ] Deduced a trap composed of 17 places in 639 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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 04:31:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:31:02] [INFO ] After 225561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
[2023-03-22 04:31:02] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-22 04:31:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3382 places, 2882 transitions and 12694 arcs took 15 ms.
[2023-03-22 04:31:03] [INFO ] Flatten gal took : 458 ms
Total runtime 338317 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/1364/inv_0_ --invariant=/tmp/1364/inv_1_ --invariant=/tmp/1364/inv_2_ --invariant=/tmp/1364/inv_3_ --invariant=/tmp/1364/inv_4_ --invariant=/tmp/1364/inv_5_ --invariant=/tmp/1364/inv_6_ --invariant=/tmp/1364/inv_7_ --invariant=/tmp/1364/inv_8_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15572592 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16090316 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="ShieldPPPs-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 ShieldPPPs-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-167903717100527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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