About the Execution of ITS-Tools for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2348.168 | 423663.00 | 455136.00 | 1105.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095900533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095900533
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 110K May 10 09:33 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 DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652788638480
Running Version 202205111006
[2022-05-17 11:57:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 11:57:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:57:20] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-17 11:57:20] [INFO ] Transformed 354 places.
[2022-05-17 11:57:20] [INFO ] Transformed 311 transitions.
[2022-05-17 11:57:20] [INFO ] Found NUPN structural information;
[2022-05-17 11:57:20] [INFO ] Parsed PT model containing 354 places and 311 transitions in 357 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 297 rows 354 cols
[2022-05-17 11:57:20] [INFO ] Computed 59 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 227 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :6
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :1
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
// Phase 1: matrix 297 rows 354 cols
[2022-05-17 11:57:21] [INFO ] Computed 59 place invariants in 11 ms
[2022-05-17 11:57:21] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2022-05-17 11:57:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2022-05-17 11:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:21] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2022-05-17 11:57:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-17 11:57:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 241 ms returned sat
[2022-05-17 11:57:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:27] [INFO ] [Nat]Absence check using state equation in 4606 ms returned unknown
[2022-05-17 11:57:27] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 11:57:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:27] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-17 11:57:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2022-05-17 11:57:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 1073 ms returned sat
[2022-05-17 11:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:32] [INFO ] [Nat]Absence check using state equation in 3616 ms returned unknown
[2022-05-17 11:57:32] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 11:57:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 11:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:33] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-05-17 11:57:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-17 11:57:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 282 ms returned sat
[2022-05-17 11:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:37] [INFO ] [Nat]Absence check using state equation in 3753 ms returned sat
[2022-05-17 11:57:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 11:57:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 11:57:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 787 ms returned unknown
[2022-05-17 11:57:38] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 11:57:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 11:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:38] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-05-17 11:57:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-05-17 11:57:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 367 ms returned sat
[2022-05-17 11:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:43] [INFO ] [Nat]Absence check using state equation in 4524 ms returned unknown
[2022-05-17 11:57:43] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 11:57:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2022-05-17 11:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:43] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-17 11:57:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2022-05-17 11:57:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 1094 ms returned sat
[2022-05-17 11:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:46] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2022-05-17 11:57:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 239 ms returned sat
[2022-05-17 11:57:46] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 55 ms.
[2022-05-17 11:57:48] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 6 ms to minimize.
[2022-05-17 11:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-17 11:57:48] [INFO ] Added : 92 causal constraints over 19 iterations in 1518 ms. Result :sat
Minimization took 541 ms.
[2022-05-17 11:57:48] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2022-05-17 11:57:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2022-05-17 11:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:49] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2022-05-17 11:57:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-05-17 11:57:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 182 ms returned sat
[2022-05-17 11:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:51] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2022-05-17 11:57:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 145 ms returned sat
[2022-05-17 11:57:51] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 33 ms.
[2022-05-17 11:57:52] [INFO ] Added : 67 causal constraints over 14 iterations in 1105 ms. Result :sat
Minimization took 394 ms.
[2022-05-17 11:57:53] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 11:57:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:53] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-17 11:57:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2022-05-17 11:57:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 272 ms returned sat
[2022-05-17 11:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:58] [INFO ] [Nat]Absence check using state equation in 4576 ms returned unknown
[2022-05-17 11:57:58] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-17 11:57:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:57:59] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-17 11:57:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:57:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 11:57:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 275 ms returned sat
[2022-05-17 11:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:03] [INFO ] [Nat]Absence check using state equation in 3721 ms returned sat
[2022-05-17 11:58:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-17 11:58:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2022-05-17 11:58:03] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2022-05-17 11:58:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2022-05-17 11:58:03] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 28 ms.
[2022-05-17 11:58:04] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 2 ms to minimize.
[2022-05-17 11:58:04] [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 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-17 11:58:04] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-17 11:58:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-17 11:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:05] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-05-17 11:58:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-17 11:58:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 1866 ms returned sat
[2022-05-17 11:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:09] [INFO ] [Nat]Absence check using state equation in 2493 ms returned sat
[2022-05-17 11:58:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 221 ms returned sat
[2022-05-17 11:58:09] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 29 ms.
[2022-05-17 11:58:10] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 2 ms to minimize.
[2022-05-17 11:58:10] [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 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 185 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:10] [INFO ] Computed 60 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 13688 resets, run finished after 2822 ms. (steps per millisecond=354 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2258 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2303 resets, run finished after 1253 ms. (steps per millisecond=798 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2263 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2255 resets, run finished after 1298 ms. (steps per millisecond=770 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2258 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2272 resets, run finished after 1127 ms. (steps per millisecond=887 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2277 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2267 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 8) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:22] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 11:58:22] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 11:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:23] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-17 11:58:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 144 ms returned sat
[2022-05-17 11:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:23] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-17 11:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:58:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 11:58:23] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 25 ms.
[2022-05-17 11:58:24] [INFO ] Added : 98 causal constraints over 20 iterations in 674 ms. Result :sat
Minimization took 213 ms.
[2022-05-17 11:58:24] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 11:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:25] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-05-17 11:58:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 305 ms returned sat
[2022-05-17 11:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:25] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-05-17 11:58:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 62 ms returned sat
[2022-05-17 11:58:26] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 22 ms.
[2022-05-17 11:58:26] [INFO ] Added : 136 causal constraints over 28 iterations in 832 ms. Result :sat
Minimization took 149 ms.
[2022-05-17 11:58:27] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-17 11:58:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2022-05-17 11:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:27] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2022-05-17 11:58:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 118 ms returned sat
[2022-05-17 11:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:28] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2022-05-17 11:58:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 39 ms returned sat
[2022-05-17 11:58:28] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-17 11:58:28] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-17 11:58:29] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2022-05-17 11:58:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
[2022-05-17 11:58:29] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-17 11:58:31] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 1 ms to minimize.
[2022-05-17 11:58:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 11:58:31] [INFO ] Added : 263 causal constraints over 53 iterations in 2235 ms. Result :sat
Minimization took 149 ms.
[2022-05-17 11:58:31] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 11:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:31] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-05-17 11:58:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 138 ms returned sat
[2022-05-17 11:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:32] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-17 11:58:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 11:58:32] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 25 ms.
[2022-05-17 11:58:32] [INFO ] Added : 71 causal constraints over 15 iterations in 593 ms. Result :sat
Minimization took 142 ms.
[2022-05-17 11:58:33] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 11:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:33] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-17 11:58:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 202 ms returned sat
[2022-05-17 11:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:34] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2022-05-17 11:58:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2022-05-17 11:58:34] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-05-17 11:58:34] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-05-17 11:58:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2022-05-17 11:58:34] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 11:58:35] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2022-05-17 11:58:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 11:58:35] [INFO ] Added : 129 causal constraints over 26 iterations in 959 ms. Result :sat
Minimization took 186 ms.
[2022-05-17 11:58:35] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 11:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:36] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-05-17 11:58:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 189 ms returned sat
[2022-05-17 11:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:37] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-05-17 11:58:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-17 11:58:37] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2022-05-17 11:58:38] [INFO ] Added : 196 causal constraints over 40 iterations in 1115 ms. Result :sat
Minimization took 228 ms.
[2022-05-17 11:58:38] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 11:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:38] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2022-05-17 11:58:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 11:58:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 184 ms returned sat
[2022-05-17 11:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:39] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2022-05-17 11:58:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 11:58:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 11:58:41] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2022-05-17 11:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 11:58:41] [INFO ] Added : 260 causal constraints over 53 iterations in 1604 ms. Result :sat
Minimization took 191 ms.
[2022-05-17 11:58:41] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:42] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2022-05-17 11:58:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 197 ms returned sat
[2022-05-17 11:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:42] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-05-17 11:58:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2022-05-17 11:58:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 22 ms.
[2022-05-17 11:58:43] [INFO ] Added : 71 causal constraints over 15 iterations in 539 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 28 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 31 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:47] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 11:58:47] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:47] [INFO ] Computed 60 place invariants in 13 ms
[2022-05-17 11:58:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:58:48] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2022-05-17 11:58:48] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:48] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-17 11:58:49] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting property specific reduction for DES-PT-60a-UpperBounds-00
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:49] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 140 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:49] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:58:49] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 11:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:49] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-17 11:58:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 139 ms returned sat
[2022-05-17 11:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:49] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-17 11:58:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:58:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-17 11:58:49] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 25 ms.
[2022-05-17 11:58:50] [INFO ] Added : 98 causal constraints over 20 iterations in 646 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:51] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13589 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2257 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:54] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:58:54] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:58:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 11:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:55] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-17 11:58:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 136 ms returned sat
[2022-05-17 11:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:55] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-17 11:58:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:58:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-17 11:58:55] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 11:58:56] [INFO ] Added : 98 causal constraints over 20 iterations in 664 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 22 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:57] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:58:57] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:57] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:58:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:58:58] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2022-05-17 11:58:58] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:58] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:58:58] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-00 in 9626 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-01
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:58] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 131 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:58:58] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:58:58] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:58:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:58:59] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-05-17 11:58:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:58:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 11:58:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 308 ms returned sat
[2022-05-17 11:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:00] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-17 11:59:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 57 ms returned sat
[2022-05-17 11:59:00] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 22 ms.
[2022-05-17 11:59:00] [INFO ] Added : 136 causal constraints over 28 iterations in 782 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:01] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13639 resets, run finished after 2341 ms. (steps per millisecond=427 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2289 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:05] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:05] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:05] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-05-17 11:59:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 290 ms returned sat
[2022-05-17 11:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:06] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-17 11:59:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 57 ms returned sat
[2022-05-17 11:59:06] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 11:59:07] [INFO ] Added : 136 causal constraints over 28 iterations in 803 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:07] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:08] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:08] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 11:59:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:09] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2022-05-17 11:59:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:09] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-17 11:59:09] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-01 in 10889 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-04
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:09] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:09] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:09] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:10] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-05-17 11:59:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 115 ms returned sat
[2022-05-17 11:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:11] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2022-05-17 11:59:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 40 ms returned sat
[2022-05-17 11:59:11] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-05-17 11:59:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-17 11:59:11] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-17 11:59:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2022-05-17 11:59:11] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 11:59:13] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2022-05-17 11:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 11:59:14] [INFO ] Added : 263 causal constraints over 53 iterations in 2247 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:14] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13636 resets, run finished after 2335 ms. (steps per millisecond=428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2274 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:18] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:18] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-17 11:59:18] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:18] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2022-05-17 11:59:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:59:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 114 ms returned sat
[2022-05-17 11:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:19] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2022-05-17 11:59:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 39 ms returned sat
[2022-05-17 11:59:20] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-05-17 11:59:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-17 11:59:20] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-17 11:59:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2022-05-17 11:59:20] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-17 11:59:22] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2022-05-17 11:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 11:59:22] [INFO ] Added : 263 causal constraints over 53 iterations in 2203 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:23] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:23] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:23] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:24] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2022-05-17 11:59:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:24] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:25] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-04 in 15398 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-06
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:25] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:25] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:25] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:59:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:25] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-17 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:59:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 138 ms returned sat
[2022-05-17 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:25] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-17 11:59:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 11:59:25] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2022-05-17 11:59:26] [INFO ] Added : 71 causal constraints over 15 iterations in 570 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:26] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13637 resets, run finished after 2339 ms. (steps per millisecond=427 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2282 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:30] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 11:59:30] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:30] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-17 11:59:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:59:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 137 ms returned sat
[2022-05-17 11:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:30] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-17 11:59:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 11:59:30] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 11:59:31] [INFO ] Added : 71 causal constraints over 15 iterations in 560 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:31] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:32] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:32] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:33] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2022-05-17 11:59:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:33] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:33] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-06 in 8521 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-08
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:33] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 131 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:33] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:33] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:33] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-05-17 11:59:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 11:59:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 199 ms returned sat
[2022-05-17 11:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:34] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2022-05-17 11:59:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2022-05-17 11:59:34] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-17 11:59:35] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2022-05-17 11:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2022-05-17 11:59:35] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2022-05-17 11:59:36] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2022-05-17 11:59:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 11:59:36] [INFO ] Added : 129 causal constraints over 26 iterations in 951 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:36] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13642 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2254 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:40] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:40] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 11:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:40] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-05-17 11:59:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 199 ms returned sat
[2022-05-17 11:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:41] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2022-05-17 11:59:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2022-05-17 11:59:41] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-17 11:59:41] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2022-05-17 11:59:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2022-05-17 11:59:41] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2022-05-17 11:59:42] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2022-05-17 11:59:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 11:59:42] [INFO ] Added : 129 causal constraints over 26 iterations in 932 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:43] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:43] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:43] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 11:59:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:44] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2022-05-17 11:59:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:44] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:45] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-08 in 11688 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-13
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:45] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 129 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:45] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:45] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 11:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:45] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-05-17 11:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 189 ms returned sat
[2022-05-17 11:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:46] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2022-05-17 11:59:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-17 11:59:46] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 11:59:47] [INFO ] Added : 196 causal constraints over 40 iterations in 1126 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:48] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13630 resets, run finished after 2393 ms. (steps per millisecond=417 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2258 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:52] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:52] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 11:59:52] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:52] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2022-05-17 11:59:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 11:59:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 184 ms returned sat
[2022-05-17 11:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:53] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2022-05-17 11:59:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-17 11:59:53] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 11:59:54] [INFO ] Added : 196 causal constraints over 40 iterations in 1084 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:55] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:55] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:55] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:56] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2022-05-17 11:59:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:56] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:56] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-13 in 11542 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-14
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:56] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 140 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 11:59:56] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 11:59:56] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 11:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:57] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2022-05-17 11:59:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:59:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 11:59:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 183 ms returned sat
[2022-05-17 11:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:59:58] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2022-05-17 11:59:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 11:59:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-17 11:59:58] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 11:59:59] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 0 ms to minimize.
[2022-05-17 11:59:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 11:59:59] [INFO ] Added : 260 causal constraints over 53 iterations in 1633 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:00] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13712 resets, run finished after 2331 ms. (steps per millisecond=429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2280 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:04] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 12:00:04] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 12:00:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 12:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:04] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-05-17 12:00:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 12:00:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 12:00:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 181 ms returned sat
[2022-05-17 12:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:05] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2022-05-17 12:00:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 12:00:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 12:00:05] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2022-05-17 12:00:06] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2022-05-17 12:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 12:00:06] [INFO ] Added : 260 causal constraints over 53 iterations in 1623 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:07] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 12:00:08] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:08] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 12:00:09] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2022-05-17 12:00:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:09] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 12:00:09] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-14 in 12860 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-15
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:09] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 139 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:09] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:09] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 12:00:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-17 12:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:10] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-17 12:00:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 12:00:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 12:00:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 195 ms returned sat
[2022-05-17 12:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:10] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-05-17 12:00:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 12:00:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2022-05-17 12:00:10] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2022-05-17 12:00:11] [INFO ] Added : 71 causal constraints over 15 iterations in 526 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:11] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13643 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2271 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 1) seen :0
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:15] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:15] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 12:00:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 12:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:15] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-05-17 12:00:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 12:00:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 12:00:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 196 ms returned sat
[2022-05-17 12:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 12:00:16] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-17 12:00:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 12:00:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2022-05-17 12:00:16] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2022-05-17 12:00:16] [INFO ] Added : 71 causal constraints over 15 iterations in 526 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 21 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:17] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:17] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:17] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 12:00:18] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2022-05-17 12:00:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 293 rows 351 cols
[2022-05-17 12:00:18] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 12:00:18] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-15 in 9282 ms.
[2022-05-17 12:00:19] [INFO ] Flatten gal took : 142 ms
[2022-05-17 12:00:19] [INFO ] Applying decomposition
[2022-05-17 12:00:19] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13176472470789845227.txt' '-o' '/tmp/graph13176472470789845227.bin' '-w' '/tmp/graph13176472470789845227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13176472470789845227.bin' '-l' '-1' '-v' '-w' '/tmp/graph13176472470789845227.weights' '-q' '0' '-e' '0.001'
[2022-05-17 12:00:19] [INFO ] Decomposing Gal with order
[2022-05-17 12:00:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 12:00:19] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-17 12:00:19] [INFO ] Flatten gal took : 105 ms
[2022-05-17 12:00:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2022-05-17 12:00:19] [INFO ] Time to serialize gal into /tmp/UpperBounds11616006227206518529.gal : 9 ms
[2022-05-17 12:00:19] [INFO ] Time to serialize properties into /tmp/UpperBounds4613257848899245056.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11616006227206518529.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4613257848899245056.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds4613257848899245056.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.13707e+13,146.951,1581440,58599,14150,3.48912e+06,29127,235,2.96671e+06,538,411640,0
Total reachable state count : 41370672495980
Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-00 :0 <= u12.p132 <= 1
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-00,0,179.057,1587128,1,0,3.48912e+06,440130,402,3.42722e+06,710,5.2866e+06,7692
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-01 :0 <= u13.p48 <= 1
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-01,0,190.674,1587652,1,0,3.48912e+06,520422,428,4.28599e+06,735,6.14955e+06,16413
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-04 :0 <= u46.p66 <= 1
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-04,0,214.801,1596568,1,0,3.48912e+06,795296,451,6.14916e+06,864,9.21266e+06,20119
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-06 :0 <= u12.p161 <= 1
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-06,0,214.969,1596568,1,0,3.48912e+06,795316,473,6.18646e+06,905,9.21278e+06,20130
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-08 :0 <= u13.p51 <= 1
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-08,0,229.188,1735692,1,0,3.48912e+06,861938,496,6.71064e+06,924,9.96524e+06,20344
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-13 :0 <= u2.p199 <= 1
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-13,0,229.19,1735692,1,0,3.48912e+06,861969,525,6.71065e+06,1019,9.96546e+06,20374
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-14 :0 <= u2.p190 <= 1
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-14,0,229.191,1735692,1,0,3.48912e+06,862000,540,6.71065e+06,1136,9.96576e+06,20403
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-15 :0 <= u13.p54 <= 1
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-15,0,241.796,1936460,1,0,3.48912e+06,902153,563,7.1393e+06,1147,1.04053e+07,20617
Total runtime 421945 ms.
BK_STOP 1652789062143
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DES-PT-60a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-60a, 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 r042-smll-165252095900533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 ;