About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3989.523 | 3600000.00 | 3670751.00 | 8756.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 0 | normal |
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.r235-tall-167856422300797.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300797
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.3M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678698400071
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 09:06:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 09:06:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:06:41] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2023-03-13 09:06:41] [INFO ] Transformed 6876 places.
[2023-03-13 09:06:41] [INFO ] Transformed 9571 transitions.
[2023-03-13 09:06:41] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 465 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 9299 out of 9571 initially.
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-13 09:06:42] [INFO ] Computed 649 place invariants in 448 ms
Incomplete random walk after 10000 steps, including 120 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :5
[2023-03-13 09:06:43] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-13 09:06:43] [INFO ] Computed 649 place invariants in 303 ms
[2023-03-13 09:06:44] [INFO ] [Real]Absence check using 54 positive place invariants in 85 ms returned sat
[2023-03-13 09:06:44] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 205 ms returned unsat
[2023-03-13 09:06:45] [INFO ] [Real]Absence check using 54 positive place invariants in 90 ms returned sat
[2023-03-13 09:06:45] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 221 ms returned unsat
[2023-03-13 09:06:46] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-13 09:06:46] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 223 ms returned unsat
[2023-03-13 09:06:47] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-13 09:06:47] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 221 ms returned unsat
[2023-03-13 09:06:48] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2023-03-13 09:06:48] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 249 ms returned sat
[2023-03-13 09:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:06:52] [INFO ] [Real]Absence check using state equation in 4123 ms returned unknown
[2023-03-13 09:06:53] [INFO ] [Real]Absence check using 54 positive place invariants in 79 ms returned sat
[2023-03-13 09:06:53] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 235 ms returned sat
[2023-03-13 09:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:06:57] [INFO ] [Real]Absence check using state equation in 4130 ms returned unknown
[2023-03-13 09:06:58] [INFO ] [Real]Absence check using 54 positive place invariants in 71 ms returned sat
[2023-03-13 09:06:58] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 209 ms returned unsat
[2023-03-13 09:06:59] [INFO ] [Real]Absence check using 54 positive place invariants in 83 ms returned sat
[2023-03-13 09:06:59] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 214 ms returned unsat
[2023-03-13 09:06:59] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-13 09:07:00] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 225 ms returned unsat
[2023-03-13 09:07:00] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-13 09:07:00] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 216 ms returned unsat
[2023-03-13 09:07:01] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-13 09:07:01] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 242 ms returned sat
[2023-03-13 09:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:07:05] [INFO ] [Real]Absence check using state equation in 4137 ms returned unknown
[2023-03-13 09:07:06] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-13 09:07:06] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 206 ms returned unsat
[2023-03-13 09:07:07] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-13 09:07:07] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 232 ms returned sat
[2023-03-13 09:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:07:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-13 09:07:12] [INFO ] [Real]Absence check using 54 positive place invariants in 84 ms returned sat
[2023-03-13 09:07:12] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 211 ms returned unsat
[2023-03-13 09:07:13] [INFO ] [Real]Absence check using 54 positive place invariants in 73 ms returned sat
[2023-03-13 09:07:13] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 242 ms returned sat
[2023-03-13 09:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:07:17] [INFO ] [Real]Absence check using state equation in 4126 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 51, 1, 1, 1, 1, 17, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.23 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2174 transitions
Trivial Post-agglo rules discarded 2174 transitions
Performed 2174 trivial Post agglomeration. Transition count delta: 2174
Iterating post reduction 0 with 2174 rules applied. Total rules applied 2175 place count 6840 transition count 7397
Reduce places removed 2174 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4350 place count 4666 transition count 7396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 7 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1902 places :
Symmetric choice reduction at 3 with 1902 rule applications. Total rules 6797 place count 2491 transition count 5222
Iterating global reduction 3 with 1902 rules applied. Total rules applied 8699 place count 2491 transition count 5222
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 8699 place count 2491 transition count 5208
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 8727 place count 2477 transition count 5208
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 8963 place count 2241 transition count 3320
Iterating global reduction 3 with 236 rules applied. Total rules applied 9199 place count 2241 transition count 3320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9233 place count 2224 transition count 3303
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 9394 place count 2224 transition count 4794
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 9555 place count 2063 transition count 4794
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 9589 place count 2063 transition count 4794
Applied a total of 9589 rules in 1860 ms. Remains 2063 /6876 variables (removed 4813) and now considering 4794/9571 (removed 4777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1861 ms. Remains : 2063/6876 places, 4794/9571 transitions.
Normalized transition count is 4397 out of 4794 initially.
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-13 09:07:19] [INFO ] Computed 613 place invariants in 81 ms
Incomplete random walk after 1000000 steps, including 20073 resets, run finished after 19737 ms. (steps per millisecond=50 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4443 ms. (steps per millisecond=225 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000000 steps, including 3878 resets, run finished after 4430 ms. (steps per millisecond=225 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4422 ms. (steps per millisecond=226 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4427 ms. (steps per millisecond=225 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4438 ms. (steps per millisecond=225 ) properties (out of 5) seen :1
[2023-03-13 09:08:01] [INFO ] Flow matrix only has 4397 transitions (discarded 397 similar events)
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-13 09:08:01] [INFO ] Computed 613 place invariants in 67 ms
[2023-03-13 09:08:01] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:08:01] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 96 ms returned sat
[2023-03-13 09:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:03] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2023-03-13 09:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:08:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-13 09:08:03] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 112 ms returned sat
[2023-03-13 09:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:05] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2023-03-13 09:08:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:08:07] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1951 ms returned sat
[2023-03-13 09:08:08] [INFO ] Deduced a trap composed of 482 places in 1581 ms of which 19 ms to minimize.
[2023-03-13 09:08:10] [INFO ] Deduced a trap composed of 211 places in 1736 ms of which 2 ms to minimize.
[2023-03-13 09:08:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3735 ms
[2023-03-13 09:08:11] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 389 ms.
[2023-03-13 09:08:12] [INFO ] Added : 22 causal constraints over 5 iterations in 2043 ms. Result :sat
[2023-03-13 09:08:13] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-13 09:08:13] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 52 ms returned unsat
[2023-03-13 09:08:13] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2023-03-13 09:08:13] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-13 09:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:15] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2023-03-13 09:08:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:08:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:08:15] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-13 09:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:16] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2023-03-13 09:08:17] [INFO ] [Nat]Added 2722 Read/Feed constraints in 616 ms returned sat
[2023-03-13 09:08:19] [INFO ] Deduced a trap composed of 244 places in 1565 ms of which 2 ms to minimize.
[2023-03-13 09:08:21] [INFO ] Deduced a trap composed of 190 places in 1609 ms of which 3 ms to minimize.
[2023-03-13 09:08:22] [INFO ] Deduced a trap composed of 311 places in 1601 ms of which 3 ms to minimize.
[2023-03-13 09:08:24] [INFO ] Deduced a trap composed of 355 places in 1520 ms of which 2 ms to minimize.
[2023-03-13 09:08:26] [INFO ] Deduced a trap composed of 313 places in 1536 ms of which 2 ms to minimize.
[2023-03-13 09:08:28] [INFO ] Deduced a trap composed of 381 places in 1542 ms of which 2 ms to minimize.
[2023-03-13 09:08:31] [INFO ] Deduced a trap composed of 220 places in 1745 ms of which 2 ms to minimize.
[2023-03-13 09:08:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 14572 ms
[2023-03-13 09:08:32] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 662 ms.
[2023-03-13 09:08:33] [INFO ] Added : 20 causal constraints over 4 iterations in 1775 ms. Result :sat
[2023-03-13 09:08:34] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-13 09:08:34] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 116 ms returned sat
[2023-03-13 09:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:35] [INFO ] [Real]Absence check using state equation in 1338 ms returned sat
[2023-03-13 09:08:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:08:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:08:36] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2023-03-13 09:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:37] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-13 09:08:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 09:08:43] [INFO ] [Nat]Added 2722 Read/Feed constraints in 6142 ms returned unknown
[2023-03-13 09:08:43] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 09:08:43] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-13 09:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:45] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2023-03-13 09:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:08:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:08:45] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-13 09:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:08:46] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2023-03-13 09:08:48] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1273 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 0] Max seen :[0, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 2063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2063/2063 places, 4794/4794 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2063 transition count 4793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2062 transition count 4793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 2061 transition count 4792
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 2061 transition count 4792
Applied a total of 4 rules in 362 ms. Remains 2061 /2063 variables (removed 2) and now considering 4792/4794 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 2061/2063 places, 4792/4794 transitions.
Normalized transition count is 4395 out of 4792 initially.
// Phase 1: matrix 4395 rows 2061 cols
[2023-03-13 09:08:48] [INFO ] Computed 613 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 20076 resets, run finished after 19597 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4407 ms. (steps per millisecond=226 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4398 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
[2023-03-13 09:09:17] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
// Phase 1: matrix 4395 rows 2061 cols
[2023-03-13 09:09:17] [INFO ] Computed 613 place invariants in 79 ms
[2023-03-13 09:09:17] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:09:17] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 104 ms returned sat
[2023-03-13 09:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:09:19] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2023-03-13 09:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:09:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 09:09:19] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 104 ms returned sat
[2023-03-13 09:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:09:20] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2023-03-13 09:09:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:09:21] [INFO ] [Nat]Added 2722 Read/Feed constraints in 860 ms returned sat
[2023-03-13 09:09:23] [INFO ] Deduced a trap composed of 320 places in 1511 ms of which 2 ms to minimize.
[2023-03-13 09:09:25] [INFO ] Deduced a trap composed of 373 places in 1608 ms of which 2 ms to minimize.
[2023-03-13 09:09:27] [INFO ] Deduced a trap composed of 351 places in 1556 ms of which 2 ms to minimize.
[2023-03-13 09:09:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6062 ms
[2023-03-13 09:09:28] [INFO ] Computed and/alt/rep : 1680/4434/1680 causal constraints (skipped 2698 transitions) in 277 ms.
[2023-03-13 09:09:29] [INFO ] Added : 16 causal constraints over 4 iterations in 1238 ms. Result :sat
[2023-03-13 09:09:29] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 09:09:29] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2023-03-13 09:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:09:30] [INFO ] [Real]Absence check using state equation in 1266 ms returned sat
[2023-03-13 09:09:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:09:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-13 09:09:31] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 104 ms returned sat
[2023-03-13 09:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:09:32] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2023-03-13 09:09:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 09:09:36] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4226 ms returned sat
[2023-03-13 09:09:38] [INFO ] Deduced a trap composed of 401 places in 1618 ms of which 2 ms to minimize.
[2023-03-13 09:09:42] [INFO ] Deduced a trap composed of 417 places in 1549 ms of which 2 ms to minimize.
[2023-03-13 09:09:44] [INFO ] Deduced a trap composed of 416 places in 1827 ms of which 2 ms to minimize.
[2023-03-13 09:09:47] [INFO ] Deduced a trap composed of 326 places in 1743 ms of which 2 ms to minimize.
[2023-03-13 09:09:49] [INFO ] Deduced a trap composed of 419 places in 1823 ms of which 2 ms to minimize.
[2023-03-13 09:09:52] [INFO ] Deduced a trap composed of 364 places in 1709 ms of which 2 ms to minimize.
[2023-03-13 09:09:54] [INFO ] Deduced a trap composed of 329 places in 1553 ms of which 3 ms to minimize.
[2023-03-13 09:09:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 18259 ms
[2023-03-13 09:09:55] [INFO ] Computed and/alt/rep : 1680/4434/1680 causal constraints (skipped 2698 transitions) in 253 ms.
[2023-03-13 09:09:56] [INFO ] Added : 21 causal constraints over 5 iterations in 1770 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 4792/4792 transitions.
Applied a total of 0 rules in 154 ms. Remains 2061 /2061 variables (removed 0) and now considering 4792/4792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 2061/2061 places, 4792/4792 transitions.
Normalized transition count is 4395 out of 4792 initially.
// Phase 1: matrix 4395 rows 2061 cols
[2023-03-13 09:09:57] [INFO ] Computed 613 place invariants in 58 ms
Incomplete random walk after 1000000 steps, including 20079 resets, run finished after 20091 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3879 resets, run finished after 4382 ms. (steps per millisecond=228 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4409 ms. (steps per millisecond=226 ) properties (out of 2) seen :0
[2023-03-13 09:10:26] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
// Phase 1: matrix 4395 rows 2061 cols
[2023-03-13 09:10:26] [INFO ] Computed 613 place invariants in 69 ms
[2023-03-13 09:10:26] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:10:26] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2023-03-13 09:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:10:28] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2023-03-13 09:10:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:10:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:10:28] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 110 ms returned sat
[2023-03-13 09:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:10:29] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2023-03-13 09:10:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:10:30] [INFO ] [Nat]Added 2722 Read/Feed constraints in 848 ms returned sat
[2023-03-13 09:10:32] [INFO ] Deduced a trap composed of 320 places in 1524 ms of which 2 ms to minimize.
[2023-03-13 09:10:34] [INFO ] Deduced a trap composed of 373 places in 1505 ms of which 2 ms to minimize.
[2023-03-13 09:10:36] [INFO ] Deduced a trap composed of 351 places in 1609 ms of which 3 ms to minimize.
[2023-03-13 09:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6011 ms
[2023-03-13 09:10:37] [INFO ] Computed and/alt/rep : 1680/4434/1680 causal constraints (skipped 2698 transitions) in 300 ms.
[2023-03-13 09:10:38] [INFO ] Added : 16 causal constraints over 4 iterations in 1398 ms. Result :sat
[2023-03-13 09:10:38] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-13 09:10:38] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2023-03-13 09:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:10:40] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2023-03-13 09:10:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:10:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-13 09:10:40] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2023-03-13 09:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:10:41] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-13 09:10:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 09:10:46] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4242 ms returned sat
[2023-03-13 09:10:47] [INFO ] Deduced a trap composed of 401 places in 1578 ms of which 2 ms to minimize.
[2023-03-13 09:10:52] [INFO ] Deduced a trap composed of 417 places in 1611 ms of which 2 ms to minimize.
[2023-03-13 09:10:54] [INFO ] Deduced a trap composed of 416 places in 1728 ms of which 2 ms to minimize.
[2023-03-13 09:10:57] [INFO ] Deduced a trap composed of 326 places in 1833 ms of which 2 ms to minimize.
[2023-03-13 09:10:59] [INFO ] Deduced a trap composed of 419 places in 1816 ms of which 2 ms to minimize.
[2023-03-13 09:11:01] [INFO ] Deduced a trap composed of 364 places in 1767 ms of which 2 ms to minimize.
[2023-03-13 09:11:03] [INFO ] Deduced a trap composed of 329 places in 1557 ms of which 2 ms to minimize.
[2023-03-13 09:11:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 18314 ms
[2023-03-13 09:11:04] [INFO ] Computed and/alt/rep : 1680/4434/1680 causal constraints (skipped 2698 transitions) in 256 ms.
[2023-03-13 09:11:06] [INFO ] Added : 21 causal constraints over 5 iterations in 1812 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 4792/4792 transitions.
Applied a total of 0 rules in 141 ms. Remains 2061 /2061 variables (removed 0) and now considering 4792/4792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 2061/2061 places, 4792/4792 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 4792/4792 transitions.
Applied a total of 0 rules in 138 ms. Remains 2061 /2061 variables (removed 0) and now considering 4792/4792 (removed 0) transitions.
[2023-03-13 09:11:06] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
[2023-03-13 09:11:06] [INFO ] Invariant cache hit.
[2023-03-13 09:11:11] [INFO ] Implicit Places using invariants in 4886 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 326, 327, 329, 331, 335, 341, 349, 359, 370, 380, 381, 382, 383, 384, 385, 386, 387, 388, 396, 402, 406, 408, 410, 412, 431, 437, 439, 440, 441, 442, 443, 444, 445, 446, 447, 449, 451, 453, 457, 463, 471, 480, 488, 489, 490, 491, 492, 493, 494, 495, 496, 502, 506, 508, 510, 512, 514, 533, 539, 541, 542, 543, 544, 545, 546, 547, 548, 549, 551, 553, 555, 557, 561, 567, 574, 580, 581, 582, 583, 584, 585, 586, 587, 588, 592, 594, 596, 598, 600, 602, 621, 627, 629, 630, 631, 632, 633, 634, 635, 636, 637, 639, 641, 643, 645, 647, 651, 656, 660, 661, 662, 663, 664, 665, 666, 667, 668, 670, 672, 674, 676, 678, 680, 699, 705, 707, 708, 709, 710, 711, 712, 713, 714, 715, 717, 719, 721, 723, 725, 727, 730, 732, 733, 734, 735, 736, 737, 738, 739, 740, 742, 744, 746, 748, 750, 752, 771, 777, 779, 780, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 810, 811, 813, 815, 817, 819, 821, 823, 842, 844, 847, 849, 850, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 869, 871, 873, 874, 875, 876, 877, 878, 879, 880, 881, 883, 885, 887, 889, 891, 893, 912, 918, 920, 921, 922, 923, 924, 925, 926, 927, 928, 930, 932, 934, 936, 938, 940, 942, 944, 945, 946, 947, 948, 949, 951, 952, 954, 956, 958, 960, 964, 966, 985, 991, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1015, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1036, 1038, 1057, 1063, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1075, 1077, 1079, 1081, 1083, 1085, 1089, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1106, 1108, 1110, 1112, 1114, 1116, 1135, 1141, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1153, 1155, 1157, 1159, 1161, 1165, 1171, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1223, 1229, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1241, 1243, 1245, 1247, 1251, 1257, 1265, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1290, 1296, 1300, 1303, 1305, 1307, 1326, 1332, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1344, 1346, 1348, 1352, 1358, 1366, 1376, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1405, 1413, 1419, 1423, 1425, 1427, 1446, 1452, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1464, 1466, 1470, 1476, 1484, 1494, 1506, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1539, 1549, 1557, 1563, 1567, 1569, 1588, 1590, 1593, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1605, 1609, 1615, 1623, 1633, 1645, 1659, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1696, 1708, 1718, 1726, 1732, 1736, 1755]
Discarding 563 places :
Implicit Place search using SMT only with invariants took 4899 ms to find 563 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1498/2061 places, 4792/4792 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1243 transition count 4537
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1243 transition count 4537
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 988 transition count 4282
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 988 transition count 4282
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 988 transition count 4279
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 985 transition count 4279
Applied a total of 1026 rules in 273 ms. Remains 985 /1498 variables (removed 513) and now considering 4279/4792 (removed 513) transitions.
[2023-03-13 09:11:12] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2023-03-13 09:11:12] [INFO ] Computed 50 place invariants in 29 ms
[2023-03-13 09:11:13] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2023-03-13 09:11:13] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2023-03-13 09:11:13] [INFO ] Invariant cache hit.
[2023-03-13 09:11:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:11:36] [INFO ] Implicit Places using invariants and state equation in 23550 ms returned []
Implicit Place search using SMT with State Equation took 24688 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 985/2061 places, 4279/4792 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29998 ms. Remains : 985/2061 places, 4279/4792 transitions.
Normalized transition count is 3882 out of 4279 initially.
// Phase 1: matrix 3882 rows 985 cols
[2023-03-13 09:11:36] [INFO ] Computed 50 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 21026 resets, run finished after 18767 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3017 resets, run finished after 3278 ms. (steps per millisecond=305 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3019 resets, run finished after 3286 ms. (steps per millisecond=304 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 09:12:02] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2023-03-13 09:12:02] [INFO ] Computed 50 place invariants in 26 ms
[2023-03-13 09:12:02] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 09:12:02] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-13 09:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:12:03] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2023-03-13 09:12:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:12:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 09:12:03] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-13 09:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:12:03] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2023-03-13 09:12:04] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:12:05] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1341 ms returned sat
[2023-03-13 09:12:05] [INFO ] Deduced a trap composed of 438 places in 489 ms of which 1 ms to minimize.
[2023-03-13 09:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
[2023-03-13 09:12:06] [INFO ] Computed and/alt/rep : 1345/1955/1345 causal constraints (skipped 2475 transitions) in 252 ms.
[2023-03-13 09:12:07] [INFO ] Added : 22 causal constraints over 5 iterations in 1132 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 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 985 transition count 4278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 984 transition count 4278
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 983 transition count 4277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 982 transition count 4276
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 982 transition count 4276
Applied a total of 6 rules in 276 ms. Remains 982 /985 variables (removed 3) and now considering 4276/4279 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 982/985 places, 4276/4279 transitions.
Normalized transition count is 3879 out of 4276 initially.
// Phase 1: matrix 3879 rows 982 cols
[2023-03-13 09:12:07] [INFO ] Computed 50 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 21030 resets, run finished after 18924 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3025 resets, run finished after 3287 ms. (steps per millisecond=304 ) properties (out of 1) seen :0
[2023-03-13 09:12:29] [INFO ] Flow matrix only has 3879 transitions (discarded 397 similar events)
// Phase 1: matrix 3879 rows 982 cols
[2023-03-13 09:12:29] [INFO ] Computed 50 place invariants in 26 ms
[2023-03-13 09:12:30] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 09:12:30] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-13 09:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:12:30] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2023-03-13 09:12:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:12:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-13 09:12:31] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2023-03-13 09:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:12:31] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2023-03-13 09:12:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:12:33] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1423 ms returned sat
[2023-03-13 09:12:33] [INFO ] Deduced a trap composed of 282 places in 447 ms of which 1 ms to minimize.
[2023-03-13 09:12:34] [INFO ] Deduced a trap composed of 90 places in 527 ms of which 1 ms to minimize.
[2023-03-13 09:12:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1250 ms
[2023-03-13 09:12:34] [INFO ] Computed and/alt/rep : 1341/1940/1341 causal constraints (skipped 2476 transitions) in 203 ms.
[2023-03-13 09:12:35] [INFO ] Added : 21 causal constraints over 5 iterations in 1099 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 100 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 982/982 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 103 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2023-03-13 09:12:36] [INFO ] Flow matrix only has 3879 transitions (discarded 397 similar events)
[2023-03-13 09:12:36] [INFO ] Invariant cache hit.
[2023-03-13 09:12:37] [INFO ] Implicit Places using invariants in 1077 ms returned [498]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4274
Applied a total of 4 rules in 161 ms. Remains 979 /981 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2023-03-13 09:12:37] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:12:37] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-13 09:12:38] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-13 09:12:38] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:12:38] [INFO ] Invariant cache hit.
[2023-03-13 09:12:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:13:02] [INFO ] Implicit Places using invariants and state equation in 24132 ms returned []
Implicit Place search using SMT with State Equation took 25290 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4274/4276 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26635 ms. Remains : 979/982 places, 4274/4276 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:13:02] [INFO ] Computed 49 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 21028 resets, run finished after 18945 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3028 resets, run finished after 3381 ms. (steps per millisecond=295 ) properties (out of 1) seen :0
[2023-03-13 09:13:24] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:13:25] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-13 09:13:25] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 09:13:25] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 09:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:13:26] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2023-03-13 09:13:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:13:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 09:13:26] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-13 09:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:13:27] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-13 09:13:27] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:13:29] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2246 ms returned sat
[2023-03-13 09:13:29] [INFO ] Deduced a trap composed of 276 places in 447 ms of which 1 ms to minimize.
[2023-03-13 09:13:30] [INFO ] Deduced a trap composed of 82 places in 567 ms of which 1 ms to minimize.
[2023-03-13 09:13:31] [INFO ] Deduced a trap composed of 97 places in 527 ms of which 1 ms to minimize.
[2023-03-13 09:13:32] [INFO ] Deduced a trap composed of 91 places in 583 ms of which 1 ms to minimize.
[2023-03-13 09:13:33] [INFO ] Deduced a trap composed of 91 places in 578 ms of which 1 ms to minimize.
[2023-03-13 09:13:34] [INFO ] Deduced a trap composed of 121 places in 572 ms of which 1 ms to minimize.
[2023-03-13 09:13:34] [INFO ] Deduced a trap composed of 129 places in 532 ms of which 1 ms to minimize.
[2023-03-13 09:13:35] [INFO ] Deduced a trap composed of 121 places in 522 ms of which 1 ms to minimize.
[2023-03-13 09:13:36] [INFO ] Deduced a trap composed of 103 places in 569 ms of which 1 ms to minimize.
[2023-03-13 09:13:36] [INFO ] Deduced a trap composed of 92 places in 575 ms of which 1 ms to minimize.
[2023-03-13 09:13:37] [INFO ] Deduced a trap composed of 104 places in 521 ms of which 1 ms to minimize.
[2023-03-13 09:13:38] [INFO ] Deduced a trap composed of 97 places in 580 ms of which 1 ms to minimize.
[2023-03-13 09:13:39] [INFO ] Deduced a trap composed of 101 places in 577 ms of which 1 ms to minimize.
[2023-03-13 09:13:39] [INFO ] Deduced a trap composed of 112 places in 577 ms of which 1 ms to minimize.
[2023-03-13 09:13:41] [INFO ] Deduced a trap composed of 108 places in 586 ms of which 1 ms to minimize.
[2023-03-13 09:13:41] [INFO ] Deduced a trap composed of 276 places in 476 ms of which 1 ms to minimize.
[2023-03-13 09:13:42] [INFO ] Deduced a trap composed of 359 places in 560 ms of which 1 ms to minimize.
[2023-03-13 09:13:43] [INFO ] Deduced a trap composed of 82 places in 587 ms of which 1 ms to minimize.
[2023-03-13 09:13:44] [INFO ] Deduced a trap composed of 87 places in 578 ms of which 2 ms to minimize.
[2023-03-13 09:13:44] [INFO ] Deduced a trap composed of 222 places in 489 ms of which 1 ms to minimize.
[2023-03-13 09:13:45] [INFO ] Deduced a trap composed of 97 places in 591 ms of which 0 ms to minimize.
[2023-03-13 09:13:46] [INFO ] Deduced a trap composed of 96 places in 578 ms of which 1 ms to minimize.
[2023-03-13 09:13:47] [INFO ] Deduced a trap composed of 82 places in 589 ms of which 1 ms to minimize.
[2023-03-13 09:13:48] [INFO ] Deduced a trap composed of 97 places in 536 ms of which 1 ms to minimize.
[2023-03-13 09:13:49] [INFO ] Deduced a trap composed of 83 places in 539 ms of which 3 ms to minimize.
[2023-03-13 09:13:49] [INFO ] Deduced a trap composed of 87 places in 528 ms of which 0 ms to minimize.
[2023-03-13 09:13:50] [INFO ] Deduced a trap composed of 85 places in 527 ms of which 0 ms to minimize.
[2023-03-13 09:13:50] [INFO ] Deduced a trap composed of 199 places in 454 ms of which 1 ms to minimize.
[2023-03-13 09:13:51] [INFO ] Deduced a trap composed of 96 places in 527 ms of which 1 ms to minimize.
[2023-03-13 09:13:52] [INFO ] Deduced a trap composed of 94 places in 554 ms of which 1 ms to minimize.
[2023-03-13 09:13:53] [INFO ] Deduced a trap composed of 87 places in 544 ms of which 1 ms to minimize.
[2023-03-13 09:13:54] [INFO ] Deduced a trap composed of 84 places in 547 ms of which 1 ms to minimize.
[2023-03-13 09:13:54] [INFO ] Deduced a trap composed of 95 places in 534 ms of which 2 ms to minimize.
[2023-03-13 09:13:55] [INFO ] Deduced a trap composed of 82 places in 543 ms of which 1 ms to minimize.
[2023-03-13 09:13:56] [INFO ] Deduced a trap composed of 85 places in 527 ms of which 2 ms to minimize.
[2023-03-13 09:13:57] [INFO ] Deduced a trap composed of 108 places in 530 ms of which 2 ms to minimize.
[2023-03-13 09:13:59] [INFO ] Deduced a trap composed of 92 places in 544 ms of which 1 ms to minimize.
[2023-03-13 09:14:00] [INFO ] Deduced a trap composed of 101 places in 529 ms of which 1 ms to minimize.
[2023-03-13 09:14:00] [INFO ] Deduced a trap composed of 97 places in 537 ms of which 1 ms to minimize.
[2023-03-13 09:14:01] [INFO ] Deduced a trap composed of 88 places in 541 ms of which 1 ms to minimize.
[2023-03-13 09:14:02] [INFO ] Deduced a trap composed of 84 places in 526 ms of which 1 ms to minimize.
[2023-03-13 09:14:02] [INFO ] Deduced a trap composed of 95 places in 518 ms of which 1 ms to minimize.
[2023-03-13 09:14:03] [INFO ] Deduced a trap composed of 83 places in 537 ms of which 1 ms to minimize.
[2023-03-13 09:14:04] [INFO ] Deduced a trap composed of 286 places in 452 ms of which 1 ms to minimize.
[2023-03-13 09:14:04] [INFO ] Deduced a trap composed of 99 places in 519 ms of which 0 ms to minimize.
[2023-03-13 09:14:05] [INFO ] Deduced a trap composed of 88 places in 516 ms of which 0 ms to minimize.
[2023-03-13 09:14:05] [INFO ] Deduced a trap composed of 293 places in 525 ms of which 1 ms to minimize.
[2023-03-13 09:14:06] [INFO ] Deduced a trap composed of 103 places in 530 ms of which 1 ms to minimize.
[2023-03-13 09:14:07] [INFO ] Deduced a trap composed of 110 places in 519 ms of which 1 ms to minimize.
[2023-03-13 09:14:07] [INFO ] Deduced a trap composed of 95 places in 518 ms of which 1 ms to minimize.
[2023-03-13 09:14:08] [INFO ] Deduced a trap composed of 108 places in 522 ms of which 1 ms to minimize.
[2023-03-13 09:14:09] [INFO ] Deduced a trap composed of 91 places in 513 ms of which 1 ms to minimize.
[2023-03-13 09:14:09] [INFO ] Deduced a trap composed of 86 places in 524 ms of which 0 ms to minimize.
[2023-03-13 09:14:10] [INFO ] Deduced a trap composed of 70 places in 521 ms of which 1 ms to minimize.
[2023-03-13 09:14:11] [INFO ] Deduced a trap composed of 110 places in 531 ms of which 0 ms to minimize.
[2023-03-13 09:14:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 105 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 103 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-13 09:14:11] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:14:11] [INFO ] Invariant cache hit.
[2023-03-13 09:14:12] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2023-03-13 09:14:12] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:14:12] [INFO ] Invariant cache hit.
[2023-03-13 09:14:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:14:36] [INFO ] Implicit Places using invariants and state equation in 24150 ms returned []
Implicit Place search using SMT with State Equation took 25284 ms to find 0 implicit places.
[2023-03-13 09:14:37] [INFO ] Redundant transitions in 306 ms returned []
[2023-03-13 09:14:37] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:14:37] [INFO ] Invariant cache hit.
[2023-03-13 09:14:38] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27101 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:14:38] [INFO ] Computed 49 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
[2023-03-13 09:14:38] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:14:38] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-13 09:14:38] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 09:14:38] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 09:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:14:39] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-13 09:14:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:14:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-13 09:14:40] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 09:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:14:40] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2023-03-13 09:14:40] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:14:43] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2172 ms returned sat
[2023-03-13 09:14:43] [INFO ] Deduced a trap composed of 276 places in 446 ms of which 1 ms to minimize.
[2023-03-13 09:14:44] [INFO ] Deduced a trap composed of 82 places in 544 ms of which 1 ms to minimize.
[2023-03-13 09:14:44] [INFO ] Deduced a trap composed of 97 places in 530 ms of which 1 ms to minimize.
[2023-03-13 09:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1881 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 119 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 979/979 places, 4274/4274 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:14:45] [INFO ] Computed 49 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 21023 resets, run finished after 19229 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3025 resets, run finished after 3332 ms. (steps per millisecond=300 ) properties (out of 1) seen :0
[2023-03-13 09:15:07] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-13 09:15:07] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-13 09:15:07] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 09:15:07] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 09:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:15:08] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2023-03-13 09:15:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:15:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 09:15:09] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-13 09:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:15:09] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2023-03-13 09:15:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:15:12] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2211 ms returned sat
[2023-03-13 09:15:12] [INFO ] Deduced a trap composed of 276 places in 449 ms of which 1 ms to minimize.
[2023-03-13 09:15:13] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 1 ms to minimize.
[2023-03-13 09:15:13] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 1 ms to minimize.
[2023-03-13 09:15:14] [INFO ] Deduced a trap composed of 91 places in 527 ms of which 0 ms to minimize.
[2023-03-13 09:15:15] [INFO ] Deduced a trap composed of 91 places in 517 ms of which 1 ms to minimize.
[2023-03-13 09:15:16] [INFO ] Deduced a trap composed of 121 places in 521 ms of which 1 ms to minimize.
[2023-03-13 09:15:17] [INFO ] Deduced a trap composed of 129 places in 536 ms of which 0 ms to minimize.
[2023-03-13 09:15:17] [INFO ] Deduced a trap composed of 121 places in 534 ms of which 0 ms to minimize.
[2023-03-13 09:15:18] [INFO ] Deduced a trap composed of 103 places in 516 ms of which 0 ms to minimize.
[2023-03-13 09:15:19] [INFO ] Deduced a trap composed of 92 places in 542 ms of which 1 ms to minimize.
[2023-03-13 09:15:20] [INFO ] Deduced a trap composed of 104 places in 532 ms of which 1 ms to minimize.
[2023-03-13 09:15:20] [INFO ] Deduced a trap composed of 97 places in 539 ms of which 1 ms to minimize.
[2023-03-13 09:15:21] [INFO ] Deduced a trap composed of 101 places in 532 ms of which 1 ms to minimize.
[2023-03-13 09:15:22] [INFO ] Deduced a trap composed of 112 places in 537 ms of which 1 ms to minimize.
[2023-03-13 09:15:23] [INFO ] Deduced a trap composed of 108 places in 541 ms of which 1 ms to minimize.
[2023-03-13 09:15:23] [INFO ] Deduced a trap composed of 276 places in 451 ms of which 1 ms to minimize.
[2023-03-13 09:15:24] [INFO ] Deduced a trap composed of 359 places in 543 ms of which 1 ms to minimize.
[2023-03-13 09:15:25] [INFO ] Deduced a trap composed of 82 places in 529 ms of which 1 ms to minimize.
[2023-03-13 09:15:26] [INFO ] Deduced a trap composed of 87 places in 526 ms of which 1 ms to minimize.
[2023-03-13 09:15:26] [INFO ] Deduced a trap composed of 222 places in 452 ms of which 1 ms to minimize.
[2023-03-13 09:15:27] [INFO ] Deduced a trap composed of 97 places in 530 ms of which 1 ms to minimize.
[2023-03-13 09:15:28] [INFO ] Deduced a trap composed of 96 places in 524 ms of which 1 ms to minimize.
[2023-03-13 09:15:29] [INFO ] Deduced a trap composed of 82 places in 538 ms of which 1 ms to minimize.
[2023-03-13 09:15:30] [INFO ] Deduced a trap composed of 97 places in 527 ms of which 1 ms to minimize.
[2023-03-13 09:15:31] [INFO ] Deduced a trap composed of 83 places in 514 ms of which 1 ms to minimize.
[2023-03-13 09:15:31] [INFO ] Deduced a trap composed of 87 places in 527 ms of which 0 ms to minimize.
[2023-03-13 09:15:32] [INFO ] Deduced a trap composed of 85 places in 521 ms of which 0 ms to minimize.
[2023-03-13 09:15:32] [INFO ] Deduced a trap composed of 199 places in 442 ms of which 1 ms to minimize.
[2023-03-13 09:15:33] [INFO ] Deduced a trap composed of 96 places in 523 ms of which 1 ms to minimize.
[2023-03-13 09:15:34] [INFO ] Deduced a trap composed of 94 places in 528 ms of which 1 ms to minimize.
[2023-03-13 09:15:35] [INFO ] Deduced a trap composed of 87 places in 520 ms of which 0 ms to minimize.
[2023-03-13 09:15:36] [INFO ] Deduced a trap composed of 84 places in 526 ms of which 1 ms to minimize.
[2023-03-13 09:15:36] [INFO ] Deduced a trap composed of 95 places in 523 ms of which 1 ms to minimize.
[2023-03-13 09:15:37] [INFO ] Deduced a trap composed of 82 places in 521 ms of which 1 ms to minimize.
[2023-03-13 09:15:37] [INFO ] Deduced a trap composed of 85 places in 514 ms of which 1 ms to minimize.
[2023-03-13 09:15:39] [INFO ] Deduced a trap composed of 108 places in 529 ms of which 1 ms to minimize.
[2023-03-13 09:15:40] [INFO ] Deduced a trap composed of 92 places in 520 ms of which 0 ms to minimize.
[2023-03-13 09:15:41] [INFO ] Deduced a trap composed of 101 places in 533 ms of which 1 ms to minimize.
[2023-03-13 09:15:42] [INFO ] Deduced a trap composed of 97 places in 528 ms of which 1 ms to minimize.
[2023-03-13 09:15:43] [INFO ] Deduced a trap composed of 88 places in 527 ms of which 0 ms to minimize.
[2023-03-13 09:15:43] [INFO ] Deduced a trap composed of 84 places in 515 ms of which 1 ms to minimize.
[2023-03-13 09:15:44] [INFO ] Deduced a trap composed of 95 places in 524 ms of which 1 ms to minimize.
[2023-03-13 09:15:45] [INFO ] Deduced a trap composed of 83 places in 522 ms of which 1 ms to minimize.
[2023-03-13 09:15:45] [INFO ] Deduced a trap composed of 286 places in 441 ms of which 1 ms to minimize.
[2023-03-13 09:15:46] [INFO ] Deduced a trap composed of 99 places in 519 ms of which 0 ms to minimize.
[2023-03-13 09:15:47] [INFO ] Deduced a trap composed of 88 places in 517 ms of which 1 ms to minimize.
[2023-03-13 09:15:47] [INFO ] Deduced a trap composed of 293 places in 516 ms of which 1 ms to minimize.
[2023-03-13 09:15:48] [INFO ] Deduced a trap composed of 103 places in 517 ms of which 1 ms to minimize.
[2023-03-13 09:15:48] [INFO ] Deduced a trap composed of 110 places in 515 ms of which 0 ms to minimize.
[2023-03-13 09:15:49] [INFO ] Deduced a trap composed of 95 places in 513 ms of which 1 ms to minimize.
[2023-03-13 09:15:50] [INFO ] Deduced a trap composed of 108 places in 531 ms of which 1 ms to minimize.
[2023-03-13 09:15:50] [INFO ] Deduced a trap composed of 91 places in 518 ms of which 1 ms to minimize.
[2023-03-13 09:15:51] [INFO ] Deduced a trap composed of 86 places in 532 ms of which 1 ms to minimize.
[2023-03-13 09:15:52] [INFO ] Deduced a trap composed of 70 places in 514 ms of which 1 ms to minimize.
[2023-03-13 09:15:53] [INFO ] Deduced a trap composed of 110 places in 572 ms of which 1 ms to minimize.
[2023-03-13 09:15:54] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 1 ms to minimize.
[2023-03-13 09:15:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 101 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 100 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-13 09:15:54] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:15:54] [INFO ] Invariant cache hit.
[2023-03-13 09:15:55] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2023-03-13 09:15:55] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:15:55] [INFO ] Invariant cache hit.
[2023-03-13 09:15:56] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-13 09:16:21] [INFO ] Implicit Places using invariants and state equation in 25682 ms returned []
Implicit Place search using SMT with State Equation took 26810 ms to find 0 implicit places.
[2023-03-13 09:16:21] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-13 09:16:21] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-13 09:16:21] [INFO ] Invariant cache hit.
[2023-03-13 09:16:23] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28506 ms. Remains : 979/979 places, 4274/4274 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 104429 ms.
[2023-03-13 09:16:23] [INFO ] Flatten gal took : 314 ms
[2023-03-13 09:16:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 09:16:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 979 places, 4274 transitions and 21307 arcs took 36 ms.
Total runtime 582106 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C08
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 979 places, 4274 transitions, 21307 arcs.
Final Score: 436982.196
Took : 69 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12149616 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093048 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 UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856422300797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;