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.r389-oct2-167903713200174.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 itstools
Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200174
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679182915394

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 23:41:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:41:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:41:58] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2023-03-18 23:41:58] [INFO ] Transformed 6003 places.
[2023-03-18 23:41:58] [INFO ] Transformed 5903 transitions.
[2023-03-18 23:41:58] [INFO ] Found NUPN structural information;
[2023-03-18 23:41:58] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 886 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
[2023-03-18 23:41:59] [INFO ] Flatten gal took : 630 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-18 23:42:00] [INFO ] Computed 901 place invariants in 57 ms
[2023-03-18 23:42:00] [INFO ] Flatten gal took : 366 ms
[2023-03-18 23:42:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7128588364152376606.gal : 111 ms
[2023-03-18 23:42:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1167149875440765093.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7128588364152376606.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1167149875440765093.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1167149875440765093.prop.
[2023-03-18 23:42:02] [INFO ] After 1967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 23:42:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 879 ms returned sat
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :69 after 186
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :186 after 650
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :650 after 4.49302e+06
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :4.49302e+06 after 5.16104e+13
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :5.16104e+13 after 3.38012e+27
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :3.38012e+27 after 3.22762e+59
[2023-03-18 23:42:27] [INFO ] After 21422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:42:27] [INFO ] After 21432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-18 23:42:27] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 148 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 6003 transition count 5436
Reduce places removed 467 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 480 rules applied. Total rules applied 947 place count 5536 transition count 5423
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 960 place count 5523 transition count 5423
Performed 489 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 489 Pre rules applied. Total rules applied 960 place count 5523 transition count 4934
Deduced a syphon composed of 489 places in 25 ms
Reduce places removed 489 places and 0 transitions.
Iterating global reduction 3 with 978 rules applied. Total rules applied 1938 place count 5034 transition count 4934
Discarding 663 places :
Symmetric choice reduction at 3 with 663 rule applications. Total rules 2601 place count 4371 transition count 4271
Iterating global reduction 3 with 663 rules applied. Total rules applied 3264 place count 4371 transition count 4271
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 3264 place count 4371 transition count 4000
Deduced a syphon composed of 271 places in 20 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 3806 place count 4100 transition count 4000
Performed 1421 Post agglomeration using F-continuation condition.Transition count delta: 1421
Deduced a syphon composed of 1421 places in 22 ms
Reduce places removed 1421 places and 0 transitions.
Iterating global reduction 3 with 2842 rules applied. Total rules applied 6648 place count 2679 transition count 2579
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 669 times.
Drop transitions removed 669 transitions
Iterating global reduction 3 with 669 rules applied. Total rules applied 7317 place count 2679 transition count 2579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7318 place count 2678 transition count 2578
Applied a total of 7318 rules in 2281 ms. Remains 2678 /6003 variables (removed 3325) and now considering 2578/5903 (removed 3325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2283 ms. Remains : 2678/6003 places, 2578/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 9) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) 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 8) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2578 rows 2678 cols
[2023-03-18 23:42:31] [INFO ] Computed 901 place invariants in 163 ms
[2023-03-18 23:42:31] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:42:32] [INFO ] [Nat]Absence check using 895 positive place invariants in 290 ms returned sat
[2023-03-18 23:42:32] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-18 23:42:37] [INFO ] After 4926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:42:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:42:40] [INFO ] After 2996ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 8 places in 439 ms of which 4 ms to minimize.
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 5 places in 495 ms of which 1 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 2 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 2 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 1 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 15 places in 357 ms of which 1 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 3 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 0 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 1 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 0 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 5 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-18 23:42:50] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-18 23:42:50] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-18 23:42:50] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 0 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 4 ms to minimize.
[2023-03-18 23:42:52] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 0 ms to minimize.
[2023-03-18 23:42:52] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2023-03-18 23:42:52] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2023-03-18 23:42:53] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 0 ms to minimize.
[2023-03-18 23:42:53] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2023-03-18 23:42:53] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 1 ms to minimize.
[2023-03-18 23:42:54] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2023-03-18 23:42:54] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 12666 ms
[2023-03-18 23:42:55] [INFO ] Deduced a trap composed of 6 places in 428 ms of which 2 ms to minimize.
[2023-03-18 23:42:55] [INFO ] Deduced a trap composed of 8 places in 374 ms of which 0 ms to minimize.
[2023-03-18 23:42:56] [INFO ] Deduced a trap composed of 9 places in 362 ms of which 1 ms to minimize.
[2023-03-18 23:42:56] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 0 ms to minimize.
[2023-03-18 23:42:59] [INFO ] Deduced a trap composed of 3 places in 3250 ms of which 32 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-18 23:42:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:42:59] [INFO ] After 28264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 700 ms.
Support contains 143 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 2578/2578 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 2678 transition count 2577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2677 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 2671 transition count 2571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 2671 transition count 2571
Applied a total of 15 rules in 335 ms. Remains 2671 /2678 variables (removed 7) and now considering 2571/2578 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 2671/2678 places, 2571/2578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 62371 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62371 steps, saw 58522 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2671 cols
[2023-03-18 23:43:05] [INFO ] Computed 901 place invariants in 65 ms
[2023-03-18 23:43:05] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:43:06] [INFO ] [Nat]Absence check using 895 positive place invariants in 340 ms returned sat
[2023-03-18 23:43:06] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-18 23:43:11] [INFO ] After 3794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:43:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:43:13] [INFO ] After 2575ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 23:43:14] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2023-03-18 23:43:15] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 0 ms to minimize.
[2023-03-18 23:43:15] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2023-03-18 23:43:16] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 1 ms to minimize.
[2023-03-18 23:43:16] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 2 ms to minimize.
[2023-03-18 23:43:17] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 4 ms to minimize.
[2023-03-18 23:43:17] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 2 ms to minimize.
[2023-03-18 23:43:17] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 1 ms to minimize.
[2023-03-18 23:43:18] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 1 ms to minimize.
[2023-03-18 23:43:18] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2023-03-18 23:43:19] [INFO ] Deduced a trap composed of 14 places in 570 ms of which 1 ms to minimize.
[2023-03-18 23:43:19] [INFO ] Deduced a trap composed of 9 places in 470 ms of which 1 ms to minimize.
[2023-03-18 23:43:20] [INFO ] Deduced a trap composed of 12 places in 402 ms of which 1 ms to minimize.
[2023-03-18 23:43:21] [INFO ] Deduced a trap composed of 17 places in 733 ms of which 1 ms to minimize.
[2023-03-18 23:43:21] [INFO ] Deduced a trap composed of 18 places in 360 ms of which 1 ms to minimize.
[2023-03-18 23:43:22] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 1 ms to minimize.
[2023-03-18 23:43:22] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 0 ms to minimize.
[2023-03-18 23:43:24] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:43:24] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 0 ms to minimize.
[2023-03-18 23:43:24] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 20 ms to minimize.
[2023-03-18 23:43:25] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2023-03-18 23:43:25] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2023-03-18 23:43:25] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2023-03-18 23:43:26] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 0 ms to minimize.
[2023-03-18 23:43:26] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 1 ms to minimize.
[2023-03-18 23:43:27] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 0 ms to minimize.
[2023-03-18 23:43:27] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-18 23:43:27] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 2 ms to minimize.
[2023-03-18 23:43:28] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 3 ms to minimize.
[2023-03-18 23:43:28] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-18 23:43:29] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 2 ms to minimize.
[2023-03-18 23:43:29] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 21 ms to minimize.
[2023-03-18 23:43:30] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 3 ms to minimize.
[2023-03-18 23:43:30] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 1 ms to minimize.
[2023-03-18 23:43:30] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 0 ms to minimize.
[2023-03-18 23:43:33] [INFO ] Deduced a trap composed of 3 places in 2434 ms of which 3 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-18 23:43:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:43:33] [INFO ] After 27487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 999 ms.
Support contains 143 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 115 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2671/2671 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 114 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-18 23:43:34] [INFO ] Invariant cache hit.
[2023-03-18 23:43:36] [INFO ] Implicit Places using invariants in 2203 ms returned [2656]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2670/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 100 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2428 ms. Remains : 2670/2671 places, 2571/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 66579 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66579 steps, saw 62192 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2670 cols
[2023-03-18 23:43:41] [INFO ] Computed 900 place invariants in 19 ms
[2023-03-18 23:43:41] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:43:42] [INFO ] [Nat]Absence check using 894 positive place invariants in 318 ms returned sat
[2023-03-18 23:43:42] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 52 ms returned sat
[2023-03-18 23:43:47] [INFO ] After 4024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:43:48] [INFO ] Deduced a trap composed of 6 places in 507 ms of which 1 ms to minimize.
[2023-03-18 23:43:48] [INFO ] Deduced a trap composed of 9 places in 474 ms of which 1 ms to minimize.
[2023-03-18 23:43:49] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 1 ms to minimize.
[2023-03-18 23:43:49] [INFO ] Deduced a trap composed of 9 places in 448 ms of which 1 ms to minimize.
[2023-03-18 23:43:50] [INFO ] Deduced a trap composed of 10 places in 440 ms of which 1 ms to minimize.
[2023-03-18 23:43:51] [INFO ] Deduced a trap composed of 5 places in 485 ms of which 1 ms to minimize.
[2023-03-18 23:43:51] [INFO ] Deduced a trap composed of 9 places in 493 ms of which 1 ms to minimize.
[2023-03-18 23:43:52] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 2 ms to minimize.
[2023-03-18 23:43:52] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 0 ms to minimize.
[2023-03-18 23:43:53] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2023-03-18 23:43:53] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 1 ms to minimize.
[2023-03-18 23:43:54] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 1 ms to minimize.
[2023-03-18 23:43:55] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 1 ms to minimize.
[2023-03-18 23:43:55] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 1 ms to minimize.
[2023-03-18 23:43:56] [INFO ] Deduced a trap composed of 7 places in 440 ms of which 1 ms to minimize.
[2023-03-18 23:43:56] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2023-03-18 23:43:57] [INFO ] Deduced a trap composed of 15 places in 445 ms of which 1 ms to minimize.
[2023-03-18 23:43:57] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 0 ms to minimize.
[2023-03-18 23:43:58] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 0 ms to minimize.
[2023-03-18 23:43:58] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 1 ms to minimize.
[2023-03-18 23:43:59] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 0 ms to minimize.
[2023-03-18 23:43:59] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 1 ms to minimize.
[2023-03-18 23:43:59] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 1 ms to minimize.
[2023-03-18 23:44:00] [INFO ] Deduced a trap composed of 21 places in 622 ms of which 1 ms to minimize.
[2023-03-18 23:44:01] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 1 ms to minimize.
[2023-03-18 23:44:01] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 2 ms to minimize.
[2023-03-18 23:44:02] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2023-03-18 23:44:02] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 0 ms to minimize.
[2023-03-18 23:44:02] [INFO ] Deduced a trap composed of 27 places in 354 ms of which 1 ms to minimize.
[2023-03-18 23:44:03] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 0 ms to minimize.
[2023-03-18 23:44:03] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 2 ms to minimize.
[2023-03-18 23:44:04] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 1 ms to minimize.
[2023-03-18 23:44:04] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2023-03-18 23:44:05] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-18 23:44:05] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 2 ms to minimize.
[2023-03-18 23:44:06] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 0 ms to minimize.
[2023-03-18 23:44:06] [INFO ] Deduced a trap composed of 13 places in 263 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-18 23:44:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:44:06] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1011 ms.
Support contains 143 out of 2670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 104 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 108 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-18 23:44:07] [INFO ] Invariant cache hit.
[2023-03-18 23:44:10] [INFO ] Implicit Places using invariants in 2141 ms returned []
[2023-03-18 23:44:10] [INFO ] Invariant cache hit.
[2023-03-18 23:44:16] [INFO ] Implicit Places using invariants and state equation in 6053 ms returned []
Implicit Place search using SMT with State Equation took 8200 ms to find 0 implicit places.
[2023-03-18 23:44:16] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-18 23:44:16] [INFO ] Invariant cache hit.
[2023-03-18 23:44:17] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10101 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 112 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-18 23:44:18] [INFO ] Invariant cache hit.
[2023-03-18 23:44:18] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:44:19] [INFO ] [Nat]Absence check using 894 positive place invariants in 310 ms returned sat
[2023-03-18 23:44:19] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 26 ms returned sat
[2023-03-18 23:44:24] [INFO ] After 4737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:44:25] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 3 ms to minimize.
[2023-03-18 23:44:26] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 1 ms to minimize.
[2023-03-18 23:44:26] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2023-03-18 23:44:27] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2023-03-18 23:44:27] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2023-03-18 23:44:28] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 1 ms to minimize.
[2023-03-18 23:44:28] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 0 ms to minimize.
[2023-03-18 23:44:28] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 1 ms to minimize.
[2023-03-18 23:44:29] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 1 ms to minimize.
[2023-03-18 23:44:30] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 1 ms to minimize.
[2023-03-18 23:44:30] [INFO ] Deduced a trap composed of 8 places in 535 ms of which 1 ms to minimize.
[2023-03-18 23:44:31] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 1 ms to minimize.
[2023-03-18 23:44:31] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 0 ms to minimize.
[2023-03-18 23:44:32] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 1 ms to minimize.
[2023-03-18 23:44:32] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 0 ms to minimize.
[2023-03-18 23:44:32] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
[2023-03-18 23:44:33] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 1 ms to minimize.
[2023-03-18 23:44:33] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 0 ms to minimize.
[2023-03-18 23:44:34] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2023-03-18 23:44:34] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 1 ms to minimize.
[2023-03-18 23:44:35] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2023-03-18 23:44:35] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 1 ms to minimize.
[2023-03-18 23:44:35] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2023-03-18 23:44:36] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 1 ms to minimize.
[2023-03-18 23:44:36] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 0 ms to minimize.
[2023-03-18 23:44:36] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 11495 ms
[2023-03-18 23:44:37] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 1 ms to minimize.
[2023-03-18 23:44:37] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2023-03-18 23:44:38] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 0 ms to minimize.
[2023-03-18 23:44:38] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2023-03-18 23:44:38] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 0 ms to minimize.
[2023-03-18 23:44:39] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 1 ms to minimize.
[2023-03-18 23:44:39] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-18 23:44:39] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 2 ms to minimize.
[2023-03-18 23:44:40] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 2 ms to minimize.
[2023-03-18 23:44:40] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2023-03-18 23:44:41] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 0 ms to minimize.
[2023-03-18 23:44:41] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
[2023-03-18 23:44:41] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 1 ms to minimize.
[2023-03-18 23:44:42] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 1 ms to minimize.
[2023-03-18 23:44:42] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 0 ms to minimize.
[2023-03-18 23:44:42] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2023-03-18 23:44:43] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 1 ms to minimize.
[2023-03-18 23:44:43] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2023-03-18 23:44:43] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 13 ms to minimize.
[2023-03-18 23:44:44] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2023-03-18 23:44:44] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 1 ms to minimize.
[2023-03-18 23:44:44] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 0 ms to minimize.
[2023-03-18 23:44:45] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2023-03-18 23:44:45] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2023-03-18 23:44:45] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 1 ms to minimize.
[2023-03-18 23:44:46] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 0 ms to minimize.
[2023-03-18 23:44:46] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 1 ms to minimize.
[2023-03-18 23:44:46] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-18 23:44:47] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 1 ms to minimize.
[2023-03-18 23:44:47] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 0 ms to minimize.
[2023-03-18 23:44:48] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:44:48] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 1 ms to minimize.
[2023-03-18 23:44:48] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 0 ms to minimize.
[2023-03-18 23:44:48] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 0 ms to minimize.
[2023-03-18 23:44:49] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2023-03-18 23:44:49] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-18 23:44:50] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 0 ms to minimize.
[2023-03-18 23:44:50] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-18 23:44:50] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2023-03-18 23:44:50] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 14024 ms
[2023-03-18 23:44:51] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-18 23:44:53] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 0 ms to minimize.
[2023-03-18 23:44:53] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 1 ms to minimize.
[2023-03-18 23:44:54] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:44:54] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2023-03-18 23:44:55] [INFO ] Deduced a trap composed of 10 places in 400 ms of which 0 ms to minimize.
[2023-03-18 23:44:56] [INFO ] Deduced a trap composed of 9 places in 542 ms of which 1 ms to minimize.
[2023-03-18 23:44:56] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 1 ms to minimize.
[2023-03-18 23:44:57] [INFO ] Deduced a trap composed of 8 places in 399 ms of which 0 ms to minimize.
[2023-03-18 23:44:57] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 0 ms to minimize.
[2023-03-18 23:44:58] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2023-03-18 23:44:58] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-18 23:44:59] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:44:59] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 0 ms to minimize.
[2023-03-18 23:45:00] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-18 23:45:00] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 0 ms to minimize.
[2023-03-18 23:45:00] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 1 ms to minimize.
[2023-03-18 23:45:01] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 1 ms to minimize.
[2023-03-18 23:45:01] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-18 23:45:02] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 0 ms to minimize.
[2023-03-18 23:45:02] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2023-03-18 23:45:02] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 1 ms to minimize.
[2023-03-18 23:45:03] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2023-03-18 23:45:03] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-18 23:45:04] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 0 ms to minimize.
[2023-03-18 23:45:04] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2023-03-18 23:45:04] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2023-03-18 23:45:05] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2023-03-18 23:45:05] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 0 ms to minimize.
[2023-03-18 23:45:05] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2023-03-18 23:45:06] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2023-03-18 23:45:06] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-18 23:45:06] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2023-03-18 23:45:07] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 15498 ms
[2023-03-18 23:45:08] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 2 ms to minimize.
[2023-03-18 23:45:08] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-18 23:45:09] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2023-03-18 23:45:10] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 1 ms to minimize.
[2023-03-18 23:45:10] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 0 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2023-03-18 23:45:12] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 0 ms to minimize.
[2023-03-18 23:45:12] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2023-03-18 23:45:13] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-18 23:45:13] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 2 ms to minimize.
[2023-03-18 23:45:14] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 0 ms to minimize.
[2023-03-18 23:45:14] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 3 ms to minimize.
[2023-03-18 23:45:15] [INFO ] Deduced a trap composed of 22 places in 407 ms of which 0 ms to minimize.
[2023-03-18 23:45:15] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2023-03-18 23:45:16] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 0 ms to minimize.
[2023-03-18 23:45:16] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 2 ms to minimize.
[2023-03-18 23:45:17] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 0 ms to minimize.
[2023-03-18 23:45:17] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 1 ms to minimize.
[2023-03-18 23:45:18] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 0 ms to minimize.
[2023-03-18 23:45:18] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 1 ms to minimize.
[2023-03-18 23:45:19] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 1 ms to minimize.
[2023-03-18 23:45:19] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2023-03-18 23:45:20] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 14 ms to minimize.
[2023-03-18 23:45:20] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2023-03-18 23:45:20] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-18 23:45:21] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2023-03-18 23:45:21] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 1 ms to minimize.
[2023-03-18 23:45:22] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 0 ms to minimize.
[2023-03-18 23:45:22] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 0 ms to minimize.
[2023-03-18 23:45:24] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 0 ms to minimize.
[2023-03-18 23:45:24] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 1 ms to minimize.
[2023-03-18 23:45:25] [INFO ] Deduced a trap composed of 40 places in 350 ms of which 1 ms to minimize.
[2023-03-18 23:45:25] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2023-03-18 23:45:26] [INFO ] Deduced a trap composed of 22 places in 807 ms of which 3 ms to minimize.
[2023-03-18 23:45:27] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-18 23:45:27] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 0 ms to minimize.
[2023-03-18 23:45:27] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 2 ms to minimize.
[2023-03-18 23:45:28] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:45:28] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
[2023-03-18 23:45:28] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 20890 ms
[2023-03-18 23:45:29] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 1 ms to minimize.
[2023-03-18 23:45:29] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 0 ms to minimize.
[2023-03-18 23:45:29] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 0 ms to minimize.
[2023-03-18 23:45:30] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 8 ms to minimize.
[2023-03-18 23:45:30] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 14 ms to minimize.
[2023-03-18 23:45:30] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-18 23:45:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2222 ms
[2023-03-18 23:45:31] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 1 ms to minimize.
[2023-03-18 23:45:32] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 1 ms to minimize.
[2023-03-18 23:45:32] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2023-03-18 23:45:33] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 2 ms to minimize.
[2023-03-18 23:45:33] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 0 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 0 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2023-03-18 23:45:35] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-18 23:45:35] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 2 ms to minimize.
[2023-03-18 23:45:36] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-18 23:45:36] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 0 ms to minimize.
[2023-03-18 23:45:37] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2023-03-18 23:45:37] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 0 ms to minimize.
[2023-03-18 23:45:37] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2023-03-18 23:45:38] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2023-03-18 23:45:38] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 1 ms to minimize.
[2023-03-18 23:45:39] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
[2023-03-18 23:45:39] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 0 ms to minimize.
[2023-03-18 23:45:39] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:45:40] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-18 23:45:40] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2023-03-18 23:45:40] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-18 23:45:41] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
[2023-03-18 23:45:41] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 1 ms to minimize.
[2023-03-18 23:45:41] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 1 ms to minimize.
[2023-03-18 23:45:42] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:45:42] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 1 ms to minimize.
[2023-03-18 23:45:43] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:45:43] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 1 ms to minimize.
[2023-03-18 23:45:43] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2023-03-18 23:45:44] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 0 ms to minimize.
[2023-03-18 23:45:44] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 1 ms to minimize.
[2023-03-18 23:45:45] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 1 ms to minimize.
[2023-03-18 23:45:45] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 0 ms to minimize.
[2023-03-18 23:45:46] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 1 ms to minimize.
[2023-03-18 23:45:46] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 14860 ms
[2023-03-18 23:45:47] [INFO ] Deduced a trap composed of 12 places in 684 ms of which 1 ms to minimize.
[2023-03-18 23:45:47] [INFO ] Deduced a trap composed of 5 places in 639 ms of which 1 ms to minimize.
[2023-03-18 23:45:49] [INFO ] Deduced a trap composed of 24 places in 1524 ms of which 1 ms to minimize.
[2023-03-18 23:45:50] [INFO ] Deduced a trap composed of 12 places in 573 ms of which 1 ms to minimize.
[2023-03-18 23:45:50] [INFO ] Deduced a trap composed of 18 places in 577 ms of which 1 ms to minimize.
[2023-03-18 23:45:51] [INFO ] Deduced a trap composed of 28 places in 581 ms of which 1 ms to minimize.
[2023-03-18 23:45:52] [INFO ] Deduced a trap composed of 30 places in 581 ms of which 1 ms to minimize.
[2023-03-18 23:45:53] [INFO ] Deduced a trap composed of 22 places in 687 ms of which 1 ms to minimize.
[2023-03-18 23:45:54] [INFO ] Deduced a trap composed of 15 places in 1503 ms of which 3 ms to minimize.
[2023-03-18 23:45:56] [INFO ] Deduced a trap composed of 19 places in 1350 ms of which 1 ms to minimize.
[2023-03-18 23:45:56] [INFO ] Deduced a trap composed of 26 places in 570 ms of which 2 ms to minimize.
[2023-03-18 23:45:57] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 2 ms to minimize.
[2023-03-18 23:45:58] [INFO ] Deduced a trap composed of 16 places in 591 ms of which 12 ms to minimize.
[2023-03-18 23:45:59] [INFO ] Deduced a trap composed of 8 places in 808 ms of which 2 ms to minimize.
[2023-03-18 23:45:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 13014 ms
[2023-03-18 23:45:59] [INFO ] After 99437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4633 ms.
[2023-03-18 23:46:03] [INFO ] After 105518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:46:04] [INFO ] Flatten gal took : 177 ms
[2023-03-18 23:46:04] [INFO ] Applying decomposition
[2023-03-18 23:46:04] [INFO ] Flatten gal took : 185 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5239693415321117634.txt' '-o' '/tmp/graph5239693415321117634.bin' '-w' '/tmp/graph5239693415321117634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5239693415321117634.bin' '-l' '-1' '-v' '-w' '/tmp/graph5239693415321117634.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:46:05] [INFO ] Decomposing Gal with order
[2023-03-18 23:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:46:06] [INFO ] Removed a total of 2300 redundant transitions.
[2023-03-18 23:46:07] [INFO ] Flatten gal took : 400 ms
[2023-03-18 23:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2023-03-18 23:46:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13603380326374892123.gal : 58 ms
[2023-03-18 23:46:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6890068151536032164.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13603380326374892123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6890068151536032164.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6890068151536032164.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 23
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :23 after 7949
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1.04919e+11 after 1.07677e+22
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.07677e+22 after 1.46031e+102
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :5.80873e+278 after 9.82223e+279
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 00:16:17] [INFO ] Flatten gal took : 1088 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9966019738436076396
[2023-03-19 00:16:18] [INFO ] Too many transitions (2571) to apply POR reductions. Disabling POR matrices.
[2023-03-19 00:16:20] [INFO ] Applying decomposition
[2023-03-19 00:16:20] [INFO ] Built C files in 2272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9966019738436076396
Running compilation step : cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 00:16:21] [INFO ] Flatten gal took : 885 ms
Compilation finished in 7050 ms.
Running link step : cd /tmp/ltsmin9966019738436076396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityCardinality00==true'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13126854812947345805.txt' '-o' '/tmp/graph13126854812947345805.bin' '-w' '/tmp/graph13126854812947345805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13126854812947345805.bin' '-l' '-1' '-v' '-w' '/tmp/graph13126854812947345805.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:16:27] [INFO ] Decomposing Gal with order
[2023-03-19 00:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:16:28] [INFO ] Removed a total of 1964 redundant transitions.
[2023-03-19 00:16:28] [INFO ] Flatten gal took : 439 ms
[2023-03-19 00:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2274 labels/synchronizations in 325 ms.
[2023-03-19 00:16:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6032773342647090749.gal : 1226 ms
[2023-03-19 00:16:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2605184219118523741.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6032773342647090749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2605184219118523741.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2605184219118523741.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 7740
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7740 after 17952
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17952 after 815568
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :815568 after 885348
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :885348 after 1.84127e+07
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.84127e+07 after 5.1298e+08
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityCardinality00==true'
Running LTSmin : cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityCardinality03==true'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityCardinality03==true'
Running LTSmin : cd /tmp/ltsmin9966019738436076396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityCardinality04==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7279924 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104796 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713200174"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;