Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 150K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 653K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 468K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 215K Mar 25 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 832K Mar 25 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M May 5 16:51 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 PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621179275382

Running Version 0
[2021-05-16 15:34:40] [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]
[2021-05-16 15:34:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:34:40] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-16 15:34:40] [INFO ] Transformed 170 places.
[2021-05-16 15:34:40] [INFO ] Transformed 2310 transitions.
[2021-05-16 15:34:40] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 15:34:40] [INFO ] Computed 39 place invariants in 90 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 15) seen :33
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :29
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :22
[2021-05-16 15:34:41] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 15:34:41] [INFO ] Computed 39 place invariants in 52 ms
[2021-05-16 15:34:42] [INFO ] [Real]Absence check using 27 positive place invariants in 35 ms returned sat
[2021-05-16 15:34:42] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 30 ms returned sat
[2021-05-16 15:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:42] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2021-05-16 15:34:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:34:43] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2021-05-16 15:34:43] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:43] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2021-05-16 15:34:43] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2021-05-16 15:34:44] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1078 ms returned sat
[2021-05-16 15:34:46] [INFO ] Deduced a trap composed of 56 places in 1584 ms of which 4 ms to minimize.
[2021-05-16 15:34:48] [INFO ] Deduced a trap composed of 58 places in 1789 ms of which 2 ms to minimize.
[2021-05-16 15:34:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 15:34:48] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2021-05-16 15:34:48] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:48] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2021-05-16 15:34:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:34:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2021-05-16 15:34:49] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:49] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-16 15:34:50] [INFO ] [Nat]Added 1030 Read/Feed constraints in 812 ms returned sat
[2021-05-16 15:34:50] [INFO ] Deduced a trap composed of 64 places in 561 ms of which 1 ms to minimize.
[2021-05-16 15:34:51] [INFO ] Deduced a trap composed of 56 places in 447 ms of which 1 ms to minimize.
[2021-05-16 15:34:52] [INFO ] Deduced a trap composed of 59 places in 770 ms of which 1 ms to minimize.
[2021-05-16 15:34:52] [INFO ] Deduced a trap composed of 64 places in 421 ms of which 0 ms to minimize.
[2021-05-16 15:34:54] [INFO ] Deduced a trap composed of 56 places in 1252 ms of which 0 ms to minimize.
[2021-05-16 15:34:54] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2021-05-16 15:34:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 15:34:54] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2021-05-16 15:34:54] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-16 15:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:55] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2021-05-16 15:34:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:34:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-16 15:34:55] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-16 15:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:34:56] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-16 15:34:57] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1054 ms returned sat
[2021-05-16 15:34:57] [INFO ] Deduced a trap composed of 64 places in 435 ms of which 0 ms to minimize.
[2021-05-16 15:34:58] [INFO ] Deduced a trap composed of 59 places in 508 ms of which 0 ms to minimize.
[2021-05-16 15:34:58] [INFO ] Deduced a trap composed of 69 places in 436 ms of which 0 ms to minimize.
[2021-05-16 15:34:59] [INFO ] Deduced a trap composed of 48 places in 418 ms of which 1 ms to minimize.
[2021-05-16 15:34:59] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 0 ms to minimize.
[2021-05-16 15:34:59] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 0 ms to minimize.
[2021-05-16 15:35:00] [INFO ] Deduced a trap composed of 58 places in 421 ms of which 1 ms to minimize.
[2021-05-16 15:35:00] [INFO ] Deduced a trap composed of 56 places in 396 ms of which 0 ms to minimize.
[2021-05-16 15:35:00] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 15:35:00] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2021-05-16 15:35:00] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-16 15:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:01] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2021-05-16 15:35:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:01] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2021-05-16 15:35:01] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-16 15:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:01] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2021-05-16 15:35:03] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1097 ms returned sat
[2021-05-16 15:35:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 653 ms.
[2021-05-16 15:35:04] [INFO ] Added : 0 causal constraints over 0 iterations in 855 ms. Result :sat
Minimization took 1785 ms.
[2021-05-16 15:35:05] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-16 15:35:05] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 17 ms returned sat
[2021-05-16 15:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:06] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2021-05-16 15:35:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-16 15:35:06] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 26 ms returned sat
[2021-05-16 15:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:07] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2021-05-16 15:35:08] [INFO ] [Nat]Added 1030 Read/Feed constraints in 958 ms returned sat
[2021-05-16 15:35:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 409 ms.
[2021-05-16 15:35:08] [INFO ] Added : 0 causal constraints over 0 iterations in 613 ms. Result :sat
Minimization took 1610 ms.
[2021-05-16 15:35:10] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2021-05-16 15:35:10] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 15 ms returned sat
[2021-05-16 15:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:11] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2021-05-16 15:35:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:11] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2021-05-16 15:35:11] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:11] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-16 15:35:13] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1034 ms returned sat
[2021-05-16 15:35:13] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 0 ms to minimize.
[2021-05-16 15:35:14] [INFO ] Deduced a trap composed of 56 places in 578 ms of which 1 ms to minimize.
[2021-05-16 15:35:14] [INFO ] Deduced a trap composed of 59 places in 330 ms of which 0 ms to minimize.
[2021-05-16 15:35:14] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 1 ms to minimize.
[2021-05-16 15:35:15] [INFO ] Deduced a trap composed of 56 places in 444 ms of which 0 ms to minimize.
[2021-05-16 15:35:15] [INFO ] Deduced a trap composed of 56 places in 463 ms of which 1 ms to minimize.
[2021-05-16 15:35:16] [INFO ] Deduced a trap composed of 63 places in 440 ms of which 0 ms to minimize.
[2021-05-16 15:35:16] [INFO ] Deduced a trap composed of 77 places in 449 ms of which 1 ms to minimize.
[2021-05-16 15:35:16] [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 5
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 15:35:17] [INFO ] [Real]Absence check using 27 positive place invariants in 184 ms returned sat
[2021-05-16 15:35:17] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 80 ms returned sat
[2021-05-16 15:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:17] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2021-05-16 15:35:17] [INFO ] [Real]Added 1030 Read/Feed constraints in 207 ms returned sat
[2021-05-16 15:35:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 17 ms returned sat
[2021-05-16 15:35:18] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:18] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2021-05-16 15:35:19] [INFO ] [Nat]Added 1030 Read/Feed constraints in 834 ms returned sat
[2021-05-16 15:35:19] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 1 ms to minimize.
[2021-05-16 15:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1103 ms
[2021-05-16 15:35:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 357 ms.
[2021-05-16 15:35:20] [INFO ] Added : 0 causal constraints over 0 iterations in 489 ms. Result :sat
Minimization took 1220 ms.
[2021-05-16 15:35:22] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2021-05-16 15:35:22] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 10 ms returned sat
[2021-05-16 15:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:22] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2021-05-16 15:35:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2021-05-16 15:35:22] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-16 15:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:22] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-16 15:35:23] [INFO ] [Nat]Added 1030 Read/Feed constraints in 876 ms returned sat
[2021-05-16 15:35:24] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 1 ms to minimize.
[2021-05-16 15:35:24] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 0 ms to minimize.
[2021-05-16 15:35:24] [INFO ] Deduced a trap composed of 69 places in 420 ms of which 1 ms to minimize.
[2021-05-16 15:35:25] [INFO ] Deduced a trap composed of 48 places in 433 ms of which 1 ms to minimize.
[2021-05-16 15:35:25] [INFO ] Deduced a trap composed of 48 places in 454 ms of which 1 ms to minimize.
[2021-05-16 15:35:26] [INFO ] Deduced a trap composed of 48 places in 437 ms of which 1 ms to minimize.
[2021-05-16 15:35:26] [INFO ] Deduced a trap composed of 58 places in 340 ms of which 1 ms to minimize.
[2021-05-16 15:35:27] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 1 ms to minimize.
[2021-05-16 15:35:27] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 1 ms to minimize.
[2021-05-16 15:35:28] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 6 ms to minimize.
[2021-05-16 15:35:28] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 15:35:28] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2021-05-16 15:35:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned unsat
[2021-05-16 15:35:28] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2021-05-16 15:35:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-16 15:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:28] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-16 15:35:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:35:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2021-05-16 15:35:28] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-16 15:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:35:29] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2021-05-16 15:35:30] [INFO ] [Nat]Added 1030 Read/Feed constraints in 858 ms returned sat
[2021-05-16 15:35:30] [INFO ] Deduced a trap composed of 69 places in 454 ms of which 1 ms to minimize.
[2021-05-16 15:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2021-05-16 15:35:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 315 ms.
[2021-05-16 15:35:31] [INFO ] Added : 0 causal constraints over 0 iterations in 469 ms. Result :sat
Minimization took 1837 ms.
[2021-05-16 15:35:33] [INFO ] [Real]Absence check using 27 positive place invariants in 60 ms returned sat
[2021-05-16 15:35:33] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 60 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, 10, -1, 10, 1, -1, 1] Max seen :[2, 4, 4, 2, 2, 4, 4, 4, 1, 1, 1]
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 364100 steps, including 39851 resets, run finished after 5608 ms. (steps per millisecond=64 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 334900 steps, including 36717 resets, run finished after 5466 ms. (steps per millisecond=61 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 421900 steps, including 51659 resets, run finished after 6382 ms. (steps per millisecond=66 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 421900 steps, including 51615 resets, run finished after 6078 ms. (steps per millisecond=69 ) properties (out of 9) seen :27 could not realise parikh vector
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 376 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2021-05-16 15:35:57] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 15:35:57] [INFO ] Computed 39 place invariants in 50 ms
[2021-05-16 15:35:58] [INFO ] Dead Transitions using invariants and state equation in 1470 ms returned [7, 9, 16, 24, 27, 29, 40, 41, 54, 59, 68, 69, 72, 85, 101, 115, 116, 123, 124, 137, 140, 155, 157, 167, 169, 171, 190, 199, 210, 211, 217, 226, 228, 248, 259, 261, 269, 270, 271, 272, 284, 285, 293, 297, 303, 326, 336, 338, 348, 351, 360, 363, 370, 375, 378, 381, 391, 397, 408, 412, 419, 422, 437, 454, 460, 465, 472, 477, 478, 482, 488, 503, 504, 505, 506, 513, 516, 519, 521, 530, 542, 545, 546, 551, 555, 556, 558, 560, 564, 573, 575, 576, 577, 579, 590, 593, 599, 605, 621, 625, 632, 636, 641, 643, 649, 656, 659, 661, 664, 665, 669, 678, 683, 686, 696, 706, 715, 724, 737, 745, 750, 751, 753, 754, 755, 763, 775, 782, 790, 793, 800, 803, 806, 810, 838, 850, 852, 857, 859, 863, 871, 873, 878, 881, 887, 888, 889, 894, 897, 913, 922, 929, 938, 940, 941, 951, 952, 955, 957, 965, 970, 972, 978, 979, 985, 1015, 1016, 1027, 1030, 1035, 1038, 1059, 1061, 1065, 1068, 1075, 1079, 1080, 1088, 1089, 1091, 1100, 1105, 1110, 1118, 1134, 1136, 1139, 1140, 1144, 1145, 1154, 1158, 1161, 1167, 1190, 1195, 1201, 1202, 1203, 1205, 1212, 1213, 1228, 1236, 1244, 1252, 1272, 1299, 1307, 1308, 1309, 1318, 1319, 1322, 1332, 1335, 1337, 1338, 1345, 1349, 1354, 1355, 1360, 1364, 1365, 1373, 1384, 1386, 1406, 1408, 1414, 1428, 1433, 1436, 1443, 1444, 1452, 1453, 1464, 1481, 1487, 1499, 1505, 1522, 1527, 1529, 1535, 1540, 1545, 1547, 1555, 1558, 1560, 1561, 1563, 1564, 1567, 1570, 1572, 1573, 1575, 1579, 1580, 1585, 1589, 1592, 1593, 1599, 1603, 1612, 1613, 1622, 1628, 1629, 1635, 1641, 1659, 1662, 1664, 1671, 1680, 1684, 1704, 1708, 1718, 1732, 1733, 1737, 1738, 1739, 1748, 1753, 1754, 1761, 1763, 1764, 1772, 1775, 1782, 1784, 1787, 1791, 1806, 1816, 1818, 1822, 1827, 1830, 1841, 1851, 1859, 1872, 1877, 1899, 1901, 1908, 1909, 1916, 1920, 1925, 1926, 1934, 1942, 1947, 1971, 1978, 1984, 1988, 1999, 2001, 2004, 2008, 2010, 2011, 2025, 2032, 2034, 2038, 2039, 2046, 2059, 2061, 2065, 2069, 2071, 2079, 2080, 2096, 2101, 2105, 2108, 2111, 2117, 2118, 2126, 2134, 2139, 2140, 2155, 2157, 2163, 2171, 2175, 2179, 2180, 2186, 2194, 2197, 2200, 2202, 2209, 2220, 2222, 2225, 2228, 2229, 2233, 2242, 2259]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2259, 2242, 2233, 2229, 2228, 2225, 2222, 2220, 2209, 2202, 2200, 2197, 2194, 2186, 2180, 2179, 2175, 2171, 2163, 2157, 2155, 2140, 2139, 2134, 2126, 2118, 2117, 2111, 2108, 2105, 2101, 2096, 2080, 2079, 2071, 2069, 2065, 2061, 2059, 2046, 2039, 2038, 2034, 2032, 2025, 2011, 2010, 2008, 2004, 2001, 1999, 1988, 1984, 1978, 1971, 1947, 1942, 1934, 1926, 1925, 1920, 1916, 1909, 1908, 1901, 1899, 1877, 1872, 1859, 1851, 1841, 1830, 1827, 1822, 1818, 1816, 1806, 1791, 1787, 1784, 1782, 1775, 1772, 1764, 1763, 1761, 1754, 1753, 1748, 1739, 1738, 1737, 1733, 1732, 1718, 1708, 1704, 1684, 1680, 1671, 1664, 1662, 1659, 1641, 1635, 1629, 1628, 1622, 1613, 1612, 1603, 1599, 1593, 1592, 1589, 1585, 1580, 1579, 1575, 1573, 1572, 1570, 1567, 1564, 1563, 1561, 1560, 1558, 1555, 1547, 1545, 1540, 1535, 1529, 1527, 1522, 1505, 1499, 1487, 1481, 1464, 1453, 1452, 1444, 1443, 1436, 1433, 1428, 1414, 1408, 1406, 1386, 1384, 1373, 1365, 1364, 1360, 1355, 1354, 1349, 1345, 1338, 1337, 1335, 1332, 1322, 1319, 1318, 1309, 1308, 1307, 1299, 1272, 1252, 1244, 1236, 1228, 1213, 1212, 1205, 1203, 1202, 1201, 1195, 1190, 1167, 1161, 1158, 1154, 1145, 1144, 1140, 1139, 1136, 1134, 1118, 1110, 1105, 1100, 1091, 1089, 1088, 1080, 1079, 1075, 1068, 1065, 1061, 1059, 1038, 1035, 1030, 1027, 1016, 1015, 985, 979, 978, 972, 970, 965, 957, 955, 952, 951, 941, 940, 938, 929, 922, 913, 897, 894, 889, 888, 887, 881, 878, 873, 871, 863, 859, 857, 852, 850, 838, 810, 806, 803, 800, 793, 790, 782, 775, 763, 755, 754, 753, 751, 750, 745, 737, 724, 715, 706, 696, 686, 683, 678, 669, 665, 664, 661, 659, 656, 649, 643, 641, 636, 632, 625, 621, 605, 599, 593, 590, 579, 577, 576, 575, 573, 564, 560, 558, 556, 555, 551, 546, 545, 542, 530, 521, 519, 516, 513, 506, 505, 504, 503, 488, 482, 478, 477, 472, 465, 460, 454, 437, 422, 419, 412, 408, 397, 391, 381, 378, 375, 370, 363, 360, 351, 348, 338, 336, 326, 303, 297, 293, 285, 284, 272, 271, 270, 269, 261, 259, 248, 228, 226, 217, 211, 210, 199, 190, 171, 169, 167, 157, 155, 140, 137, 124, 123, 116, 115, 101, 85, 72, 69, 68, 59, 54, 41, 40, 29, 27, 24, 16, 9, 7]
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 86 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:35:58] [INFO ] Computed 39 place invariants in 40 ms
Incomplete random walk after 1000000 steps, including 119420 resets, run finished after 11550 ms. (steps per millisecond=86 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 8522 resets, run finished after 1347 ms. (steps per millisecond=742 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 9575 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 7086 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 1000001 steps, including 9834 resets, run finished after 1422 ms. (steps per millisecond=703 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 9789 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 9577 resets, run finished after 1429 ms. (steps per millisecond=699 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 9043 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 1000001 steps, including 7090 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 1000001 steps, including 9165 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 9) seen :27
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:23] [INFO ] Computed 39 place invariants in 116 ms
[2021-05-16 15:36:23] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2021-05-16 15:36:23] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2021-05-16 15:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:23] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-16 15:36:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:23] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:24] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2021-05-16 15:36:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:36:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1247 ms returned sat
[2021-05-16 15:36:26] [INFO ] Deduced a trap composed of 80 places in 404 ms of which 1 ms to minimize.
[2021-05-16 15:36:26] [INFO ] Deduced a trap composed of 82 places in 431 ms of which 1 ms to minimize.
[2021-05-16 15:36:29] [INFO ] Deduced a trap composed of 60 places in 2164 ms of which 0 ms to minimize.
[2021-05-16 15:36:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3370 ms
[2021-05-16 15:36:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 256 ms.
[2021-05-16 15:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 394 ms. Result :sat
Minimization took 2165 ms.
[2021-05-16 15:36:31] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 53 ms returned sat
[2021-05-16 15:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:32] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2021-05-16 15:36:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-16 15:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:32] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2021-05-16 15:36:33] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1053 ms returned sat
[2021-05-16 15:36:34] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 0 ms to minimize.
[2021-05-16 15:36:34] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 0 ms to minimize.
[2021-05-16 15:36:35] [INFO ] Deduced a trap composed of 48 places in 418 ms of which 13 ms to minimize.
[2021-05-16 15:36:35] [INFO ] Deduced a trap composed of 75 places in 443 ms of which 0 ms to minimize.
[2021-05-16 15:36:36] [INFO ] Deduced a trap composed of 51 places in 445 ms of which 0 ms to minimize.
[2021-05-16 15:36:37] [INFO ] Deduced a trap composed of 65 places in 417 ms of which 1 ms to minimize.
[2021-05-16 15:36:37] [INFO ] Deduced a trap composed of 57 places in 445 ms of which 0 ms to minimize.
[2021-05-16 15:36:38] [INFO ] Deduced a trap composed of 56 places in 421 ms of which 0 ms to minimize.
[2021-05-16 15:36:39] [INFO ] Deduced a trap composed of 73 places in 1247 ms of which 1 ms to minimize.
[2021-05-16 15:36:40] [INFO ] Deduced a trap composed of 72 places in 359 ms of which 1 ms to minimize.
[2021-05-16 15:36:40] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 0 ms to minimize.
[2021-05-16 15:36:41] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 1 ms to minimize.
[2021-05-16 15:36:42] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 1 ms to minimize.
[2021-05-16 15:36:42] [INFO ] Deduced a trap composed of 78 places in 411 ms of which 0 ms to minimize.
[2021-05-16 15:36:43] [INFO ] Deduced a trap composed of 66 places in 371 ms of which 1 ms to minimize.
[2021-05-16 15:36:43] [INFO ] Deduced a trap composed of 62 places in 428 ms of which 1 ms to minimize.
[2021-05-16 15:36:44] [INFO ] Deduced a trap composed of 80 places in 401 ms of which 0 ms to minimize.
[2021-05-16 15:36:44] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 8 ms to minimize.
[2021-05-16 15:36:44] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 10502 ms
[2021-05-16 15:36:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 232 ms.
[2021-05-16 15:36:44] [INFO ] Added : 0 causal constraints over 0 iterations in 363 ms. Result :sat
Minimization took 1594 ms.
[2021-05-16 15:36:46] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:46] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:46] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-16 15:36:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:46] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2021-05-16 15:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:47] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2021-05-16 15:36:48] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1071 ms returned sat
[2021-05-16 15:36:49] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 1 ms to minimize.
[2021-05-16 15:36:49] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 1 ms to minimize.
[2021-05-16 15:36:50] [INFO ] Deduced a trap composed of 74 places in 368 ms of which 1 ms to minimize.
[2021-05-16 15:36:50] [INFO ] Deduced a trap composed of 70 places in 394 ms of which 0 ms to minimize.
[2021-05-16 15:36:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2017 ms
[2021-05-16 15:36:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 304 ms.
[2021-05-16 15:36:51] [INFO ] Added : 0 causal constraints over 0 iterations in 498 ms. Result :sat
Minimization took 1641 ms.
[2021-05-16 15:36:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:36:52] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-16 15:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:53] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2021-05-16 15:36:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-16 15:36:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-16 15:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:54] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-16 15:36:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1048 ms returned sat
[2021-05-16 15:36:55] [INFO ] Deduced a trap composed of 70 places in 400 ms of which 1 ms to minimize.
[2021-05-16 15:36:56] [INFO ] Deduced a trap composed of 74 places in 489 ms of which 0 ms to minimize.
[2021-05-16 15:36:56] [INFO ] Deduced a trap composed of 77 places in 248 ms of which 1 ms to minimize.
[2021-05-16 15:36:57] [INFO ] Deduced a trap composed of 67 places in 845 ms of which 0 ms to minimize.
[2021-05-16 15:36:58] [INFO ] Deduced a trap composed of 73 places in 407 ms of which 33 ms to minimize.
[2021-05-16 15:36:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3077 ms
[2021-05-16 15:36:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 263 ms.
[2021-05-16 15:36:58] [INFO ] Added : 0 causal constraints over 0 iterations in 411 ms. Result :sat
Minimization took 2451 ms.
[2021-05-16 15:37:01] [INFO ] [Real]Absence check using 12 positive place invariants in 89 ms returned sat
[2021-05-16 15:37:01] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 152 ms returned sat
[2021-05-16 15:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:02] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2021-05-16 15:37:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:37:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:37:02] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2021-05-16 15:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:03] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2021-05-16 15:37:04] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1056 ms returned sat
[2021-05-16 15:37:04] [INFO ] Deduced a trap composed of 70 places in 426 ms of which 9 ms to minimize.
[2021-05-16 15:37:05] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 11 ms to minimize.
[2021-05-16 15:37:05] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 2 ms to minimize.
[2021-05-16 15:37:06] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 0 ms to minimize.
[2021-05-16 15:37:06] [INFO ] Deduced a trap composed of 73 places in 246 ms of which 0 ms to minimize.
[2021-05-16 15:37:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2340 ms
[2021-05-16 15:37:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 242 ms.
[2021-05-16 15:37:07] [INFO ] Added : 0 causal constraints over 0 iterations in 381 ms. Result :sat
Minimization took 2397 ms.
[2021-05-16 15:37:09] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:37:09] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:09] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2021-05-16 15:37:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:37:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:37:09] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:10] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2021-05-16 15:37:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1097 ms returned sat
[2021-05-16 15:37:11] [INFO ] Deduced a trap composed of 76 places in 429 ms of which 0 ms to minimize.
[2021-05-16 15:37:12] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 0 ms to minimize.
[2021-05-16 15:37:13] [INFO ] Deduced a trap composed of 48 places in 402 ms of which 1 ms to minimize.
[2021-05-16 15:37:13] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 0 ms to minimize.
[2021-05-16 15:37:14] [INFO ] Deduced a trap composed of 51 places in 458 ms of which 0 ms to minimize.
[2021-05-16 15:37:14] [INFO ] Deduced a trap composed of 65 places in 428 ms of which 0 ms to minimize.
[2021-05-16 15:37:15] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 0 ms to minimize.
[2021-05-16 15:37:15] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 1 ms to minimize.
[2021-05-16 15:37:18] [INFO ] Deduced a trap composed of 73 places in 2248 ms of which 1 ms to minimize.
[2021-05-16 15:37:18] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 0 ms to minimize.
[2021-05-16 15:37:19] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 1 ms to minimize.
[2021-05-16 15:37:19] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2021-05-16 15:37:23] [INFO ] Deduced a trap composed of 48 places in 2782 ms of which 1 ms to minimize.
[2021-05-16 15:37:23] [INFO ] Deduced a trap composed of 78 places in 308 ms of which 1 ms to minimize.
[2021-05-16 15:37:24] [INFO ] Deduced a trap composed of 66 places in 371 ms of which 0 ms to minimize.
[2021-05-16 15:37:27] [INFO ] Deduced a trap composed of 62 places in 3087 ms of which 23 ms to minimize.
[2021-05-16 15:37:27] [INFO ] Deduced a trap composed of 80 places in 420 ms of which 0 ms to minimize.
[2021-05-16 15:37:29] [INFO ] Deduced a trap composed of 65 places in 1631 ms of which 1 ms to minimize.
[2021-05-16 15:37:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 18270 ms
[2021-05-16 15:37:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 231 ms.
[2021-05-16 15:37:30] [INFO ] Added : 0 causal constraints over 0 iterations in 426 ms. Result :sat
Minimization took 1485 ms.
[2021-05-16 15:37:31] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:37:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:32] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-16 15:37:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:37:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:37:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-16 15:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:32] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2021-05-16 15:37:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1102 ms returned sat
[2021-05-16 15:37:34] [INFO ] Deduced a trap composed of 68 places in 414 ms of which 0 ms to minimize.
[2021-05-16 15:37:35] [INFO ] Deduced a trap composed of 74 places in 423 ms of which 1 ms to minimize.
[2021-05-16 15:37:35] [INFO ] Deduced a trap composed of 72 places in 362 ms of which 1 ms to minimize.
[2021-05-16 15:37:36] [INFO ] Deduced a trap composed of 72 places in 444 ms of which 0 ms to minimize.
[2021-05-16 15:37:38] [INFO ] Deduced a trap composed of 46 places in 1448 ms of which 0 ms to minimize.
[2021-05-16 15:37:38] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 0 ms to minimize.
[2021-05-16 15:37:39] [INFO ] Deduced a trap composed of 83 places in 488 ms of which 0 ms to minimize.
[2021-05-16 15:37:40] [INFO ] Deduced a trap composed of 61 places in 636 ms of which 0 ms to minimize.
[2021-05-16 15:37:41] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 0 ms to minimize.
[2021-05-16 15:37:41] [INFO ] Deduced a trap composed of 46 places in 378 ms of which 1 ms to minimize.
[2021-05-16 15:37:41] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 0 ms to minimize.
[2021-05-16 15:37:42] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 0 ms to minimize.
[2021-05-16 15:37:42] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 1 ms to minimize.
[2021-05-16 15:37:43] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 1 ms to minimize.
[2021-05-16 15:37:43] [INFO ] Deduced a trap composed of 74 places in 417 ms of which 0 ms to minimize.
[2021-05-16 15:37:44] [INFO ] Deduced a trap composed of 74 places in 391 ms of which 1 ms to minimize.
[2021-05-16 15:37:44] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 1 ms to minimize.
[2021-05-16 15:37:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 10687 ms
[2021-05-16 15:37:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 232 ms.
[2021-05-16 15:37:45] [INFO ] Added : 0 causal constraints over 0 iterations in 434 ms. Result :sat
Minimization took 1702 ms.
[2021-05-16 15:37:47] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 15:37:47] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2021-05-16 15:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:47] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-16 15:37:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:37:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned sat
[2021-05-16 15:37:47] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2021-05-16 15:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:48] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2021-05-16 15:37:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1016 ms returned sat
[2021-05-16 15:37:49] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 1 ms to minimize.
[2021-05-16 15:37:50] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 0 ms to minimize.
[2021-05-16 15:37:50] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 0 ms to minimize.
[2021-05-16 15:37:51] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 0 ms to minimize.
[2021-05-16 15:37:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2081 ms
[2021-05-16 15:37:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 238 ms.
[2021-05-16 15:37:51] [INFO ] Added : 0 causal constraints over 0 iterations in 373 ms. Result :sat
Minimization took 1605 ms.
[2021-05-16 15:37:53] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 15:37:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2021-05-16 15:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:53] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-16 15:37:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:37:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2021-05-16 15:37:54] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 31 ms returned sat
[2021-05-16 15:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:37:54] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2021-05-16 15:37:56] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1450 ms returned sat
[2021-05-16 15:37:56] [INFO ] Deduced a trap composed of 67 places in 398 ms of which 0 ms to minimize.
[2021-05-16 15:37:57] [INFO ] Deduced a trap composed of 60 places in 490 ms of which 1 ms to minimize.
[2021-05-16 15:37:57] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 1 ms to minimize.
[2021-05-16 15:37:58] [INFO ] Deduced a trap composed of 76 places in 426 ms of which 0 ms to minimize.
[2021-05-16 15:37:58] [INFO ] Deduced a trap composed of 70 places in 407 ms of which 0 ms to minimize.
[2021-05-16 15:37:59] [INFO ] Deduced a trap composed of 70 places in 400 ms of which 0 ms to minimize.
[2021-05-16 15:37:59] [INFO ] Deduced a trap composed of 74 places in 393 ms of which 0 ms to minimize.
[2021-05-16 15:38:00] [INFO ] Deduced a trap composed of 65 places in 442 ms of which 0 ms to minimize.
[2021-05-16 15:38:01] [INFO ] Deduced a trap composed of 75 places in 406 ms of which 0 ms to minimize.
[2021-05-16 15:38:01] [INFO ] Deduced a trap composed of 72 places in 441 ms of which 1 ms to minimize.
[2021-05-16 15:38:02] [INFO ] Deduced a trap composed of 64 places in 408 ms of which 0 ms to minimize.
[2021-05-16 15:38:02] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 10 ms to minimize.
[2021-05-16 15:38:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7238 ms
[2021-05-16 15:38:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 258 ms.
[2021-05-16 15:38:03] [INFO ] Added : 0 causal constraints over 0 iterations in 441 ms. Result :sat
Minimization took 2138 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, 10, -1, 10, -1] Max seen :[2, 4, 4, 2, 2, 4, 4, 4, 1]
Incomplete Parikh walk after 400700 steps, including 43620 resets, run finished after 5068 ms. (steps per millisecond=79 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 303900 steps, including 33069 resets, run finished after 3902 ms. (steps per millisecond=77 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 644900 steps, including 70143 resets, run finished after 8105 ms. (steps per millisecond=79 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 535800 steps, including 58283 resets, run finished after 6750 ms. (steps per millisecond=79 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 311100 steps, including 33934 resets, run finished after 3975 ms. (steps per millisecond=78 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 311100 steps, including 33914 resets, run finished after 4015 ms. (steps per millisecond=77 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 303900 steps, including 33047 resets, run finished after 3951 ms. (steps per millisecond=76 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 535800 steps, including 58281 resets, run finished after 6721 ms. (steps per millisecond=79 ) properties (out of 9) seen :27 could not realise parikh vector
Incomplete Parikh walk after 298300 steps, including 32498 resets, run finished after 3755 ms. (steps per millisecond=79 ) properties (out of 9) seen :27 could not realise parikh vector
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 118 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 160 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:52] [INFO ] Computed 39 place invariants in 40 ms
[2021-05-16 15:38:53] [INFO ] Implicit Places using invariants in 1002 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:53] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:38:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:55] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
[2021-05-16 15:38:55] [INFO ] Redundant transitions in 131 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:55] [INFO ] Computed 39 place invariants in 31 ms
[2021-05-16 15:38:56] [INFO ] Dead Transitions using invariants and state equation in 715 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:56] [INFO ] Computed 39 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:56] [INFO ] Computed 39 place invariants in 30 ms
[2021-05-16 15:38:56] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-16 15:38:56] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 84 ms returned sat
[2021-05-16 15:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:38:56] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2021-05-16 15:38:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:38:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:38:57] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:38:57] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2021-05-16 15:38:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:58] [INFO ] [Nat]Added 1010 Read/Feed constraints in 957 ms returned sat
[2021-05-16 15:38:58] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 0 ms to minimize.
[2021-05-16 15:38:59] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 1 ms to minimize.
[2021-05-16 15:38:59] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 0 ms to minimize.
[2021-05-16 15:38:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1074 ms
[2021-05-16 15:38:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 172 ms.
[2021-05-16 15:38:59] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 2055 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 298300 steps, including 32495 resets, run finished after 3098 ms. (steps per millisecond=96 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 175 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:05] [INFO ] Computed 39 place invariants in 80 ms
[2021-05-16 15:39:06] [INFO ] Dead Transitions using invariants and state equation in 1487 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:06] [INFO ] Computed 39 place invariants in 52 ms
Incomplete random walk after 1000000 steps, including 119348 resets, run finished after 9371 ms. (steps per millisecond=106 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8518 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:17] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:39:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:39:17] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2021-05-16 15:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:17] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2021-05-16 15:39:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:39:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:39:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-16 15:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:18] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-16 15:39:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1086 ms returned sat
[2021-05-16 15:39:20] [INFO ] Deduced a trap composed of 80 places in 429 ms of which 0 ms to minimize.
[2021-05-16 15:39:20] [INFO ] Deduced a trap composed of 82 places in 398 ms of which 1 ms to minimize.
[2021-05-16 15:39:21] [INFO ] Deduced a trap composed of 60 places in 722 ms of which 0 ms to minimize.
[2021-05-16 15:39:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1926 ms
[2021-05-16 15:39:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 241 ms.
[2021-05-16 15:39:22] [INFO ] Added : 0 causal constraints over 0 iterations in 442 ms. Result :sat
Minimization took 2092 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 298300 steps, including 32497 resets, run finished after 3310 ms. (steps per millisecond=90 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 126 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 135 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:27] [INFO ] Computed 39 place invariants in 35 ms
[2021-05-16 15:39:28] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:28] [INFO ] Computed 39 place invariants in 26 ms
[2021-05-16 15:39:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:34] [INFO ] Implicit Places using invariants and state equation in 5970 ms returned []
Implicit Place search using SMT with State Equation took 6304 ms to find 0 implicit places.
[2021-05-16 15:39:34] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:34] [INFO ] Computed 39 place invariants in 81 ms
[2021-05-16 15:39:35] [INFO ] Dead Transitions using invariants and state equation in 1195 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 39310 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:35] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:35] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:39:35] [INFO ] [Real]Absence check using 12 positive place invariants in 58 ms returned sat
[2021-05-16 15:39:35] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 103 ms returned sat
[2021-05-16 15:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:36] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2021-05-16 15:39:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:39:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:39:36] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2021-05-16 15:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:36] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2021-05-16 15:39:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 988 ms returned sat
[2021-05-16 15:39:38] [INFO ] Deduced a trap composed of 76 places in 448 ms of which 0 ms to minimize.
[2021-05-16 15:39:40] [INFO ] Deduced a trap composed of 51 places in 1819 ms of which 1 ms to minimize.
[2021-05-16 15:39:40] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 0 ms to minimize.
[2021-05-16 15:39:41] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 1 ms to minimize.
[2021-05-16 15:39:44] [INFO ] Deduced a trap composed of 51 places in 3453 ms of which 27 ms to minimize.
[2021-05-16 15:39:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 318 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:39:45] [INFO ] Computed 39 place invariants in 35 ms
[2021-05-16 15:39:45] [INFO ] Dead Transitions using invariants and state equation in 542 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:39:45] [INFO ] Computed 39 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 119433 resets, run finished after 9868 ms. (steps per millisecond=101 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9741 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:39:56] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:39:57] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-16 15:39:57] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2021-05-16 15:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:57] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2021-05-16 15:39:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:39:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-16 15:39:57] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-16 15:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:39:58] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2021-05-16 15:39:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1054 ms returned sat
[2021-05-16 15:39:59] [INFO ] Deduced a trap composed of 59 places in 491 ms of which 0 ms to minimize.
[2021-05-16 15:40:00] [INFO ] Deduced a trap composed of 55 places in 397 ms of which 0 ms to minimize.
[2021-05-16 15:40:00] [INFO ] Deduced a trap composed of 65 places in 416 ms of which 1 ms to minimize.
[2021-05-16 15:40:01] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 1 ms to minimize.
[2021-05-16 15:40:01] [INFO ] Deduced a trap composed of 55 places in 420 ms of which 1 ms to minimize.
[2021-05-16 15:40:02] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 0 ms to minimize.
[2021-05-16 15:40:02] [INFO ] Deduced a trap composed of 53 places in 441 ms of which 0 ms to minimize.
[2021-05-16 15:40:05] [INFO ] Deduced a trap composed of 62 places in 2978 ms of which 12 ms to minimize.
[2021-05-16 15:40:06] [INFO ] Deduced a trap composed of 37 places in 424 ms of which 0 ms to minimize.
[2021-05-16 15:40:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7349 ms
[2021-05-16 15:40:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 288 ms.
[2021-05-16 15:40:07] [INFO ] Added : 0 causal constraints over 0 iterations in 488 ms. Result :sat
Minimization took 1304 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 59200 steps, including 7988 resets, run finished after 654 ms. (steps per millisecond=90 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 186 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 134 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:40:09] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 15:40:14] [INFO ] Implicit Places using invariants in 4929 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 4953 ms to find 10 implicit places.
[2021-05-16 15:40:14] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:14] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-16 15:40:15] [INFO ] Dead Transitions using invariants and state equation in 559 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 100 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 15:40:15] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:15] [INFO ] Computed 29 place invariants in 24 ms
[2021-05-16 15:40:15] [INFO ] Dead Transitions using invariants and state equation in 483 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:15] [INFO ] Computed 29 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 119310 resets, run finished after 9109 ms. (steps per millisecond=109 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9742 resets, run finished after 1183 ms. (steps per millisecond=845 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:26] [INFO ] Computed 29 place invariants in 41 ms
[2021-05-16 15:40:26] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:26] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-16 15:40:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 6 ms returned sat
[2021-05-16 15:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:27] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2021-05-16 15:40:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:40:28] [INFO ] [Nat]Added 1010 Read/Feed constraints in 859 ms returned sat
[2021-05-16 15:40:28] [INFO ] Deduced a trap composed of 49 places in 366 ms of which 1 ms to minimize.
[2021-05-16 15:40:28] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 0 ms to minimize.
[2021-05-16 15:40:29] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 1 ms to minimize.
[2021-05-16 15:40:29] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 1 ms to minimize.
[2021-05-16 15:40:30] [INFO ] Deduced a trap composed of 80 places in 426 ms of which 0 ms to minimize.
[2021-05-16 15:40:30] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 0 ms to minimize.
[2021-05-16 15:40:30] [INFO ] Deduced a trap composed of 53 places in 310 ms of which 0 ms to minimize.
[2021-05-16 15:40:31] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 1 ms to minimize.
[2021-05-16 15:40:31] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 0 ms to minimize.
[2021-05-16 15:40:32] [INFO ] Deduced a trap composed of 47 places in 560 ms of which 1 ms to minimize.
[2021-05-16 15:40:32] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 1 ms to minimize.
[2021-05-16 15:40:33] [INFO ] Deduced a trap composed of 55 places in 386 ms of which 0 ms to minimize.
[2021-05-16 15:40:33] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 0 ms to minimize.
[2021-05-16 15:40:35] [INFO ] Deduced a trap composed of 57 places in 2033 ms of which 1 ms to minimize.
[2021-05-16 15:40:35] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 1 ms to minimize.
[2021-05-16 15:40:36] [INFO ] Deduced a trap composed of 39 places in 365 ms of which 0 ms to minimize.
[2021-05-16 15:40:36] [INFO ] Deduced a trap composed of 30 places in 433 ms of which 0 ms to minimize.
[2021-05-16 15:40:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8918 ms
[2021-05-16 15:40:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 239 ms.
[2021-05-16 15:40:37] [INFO ] Added : 0 causal constraints over 0 iterations in 427 ms. Result :sat
Minimization took 1354 ms.
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Incomplete Parikh walk after 64100 steps, including 8290 resets, run finished after 737 ms. (steps per millisecond=86 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 165 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 164 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:40] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:40:40] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:40] [INFO ] Computed 29 place invariants in 36 ms
[2021-05-16 15:40:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:40:47] [INFO ] Implicit Places using invariants and state equation in 7276 ms returned []
Implicit Place search using SMT with State Equation took 7681 ms to find 0 implicit places.
[2021-05-16 15:40:47] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:40:47] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 15:40:48] [INFO ] Dead Transitions using invariants and state equation in 593 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 72948 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:40:48] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:40:48] [INFO ] Computed 39 place invariants in 30 ms
[2021-05-16 15:40:48] [INFO ] [Real]Absence check using 12 positive place invariants in 74 ms returned sat
[2021-05-16 15:40:48] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 182 ms returned sat
[2021-05-16 15:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:49] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2021-05-16 15:40:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:40:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:40:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:40:50] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-16 15:40:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:40:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 999 ms returned sat
[2021-05-16 15:40:52] [INFO ] Deduced a trap composed of 40 places in 1625 ms of which 1 ms to minimize.
[2021-05-16 15:40:53] [INFO ] Deduced a trap composed of 51 places in 438 ms of which 0 ms to minimize.
[2021-05-16 15:40:54] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 1 ms to minimize.
[2021-05-16 15:40:54] [INFO ] Deduced a trap composed of 70 places in 415 ms of which 1 ms to minimize.
[2021-05-16 15:40:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3412 ms
[2021-05-16 15:40:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 249 ms.
[2021-05-16 15:40:54] [INFO ] Added : 0 causal constraints over 0 iterations in 250 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 376500 steps, including 40984 resets, run finished after 4104 ms. (steps per millisecond=91 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:40:59] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 15:41:05] [INFO ] Dead Transitions using invariants and state equation in 6442 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:05] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 119320 resets, run finished after 9199 ms. (steps per millisecond=108 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7077 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:15] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:41:15] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:41:15] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 26 ms returned sat
[2021-05-16 15:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:16] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2021-05-16 15:41:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:41:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:41:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 5 ms returned sat
[2021-05-16 15:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:16] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2021-05-16 15:41:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:41:17] [INFO ] [Nat]Added 1010 Read/Feed constraints in 916 ms returned sat
[2021-05-16 15:41:17] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 1 ms to minimize.
[2021-05-16 15:41:18] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 0 ms to minimize.
[2021-05-16 15:41:18] [INFO ] Deduced a trap composed of 74 places in 234 ms of which 1 ms to minimize.
[2021-05-16 15:41:18] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 0 ms to minimize.
[2021-05-16 15:41:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1505 ms
[2021-05-16 15:41:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 167 ms.
[2021-05-16 15:41:19] [INFO ] Added : 0 causal constraints over 0 iterations in 283 ms. Result :sat
Minimization took 1566 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 303900 steps, including 33096 resets, run finished after 3144 ms. (steps per millisecond=96 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 108 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:24] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:41:24] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:24] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:41:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:41:30] [INFO ] Implicit Places using invariants and state equation in 5948 ms returned []
Implicit Place search using SMT with State Equation took 6292 ms to find 0 implicit places.
[2021-05-16 15:41:30] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:30] [INFO ] Computed 39 place invariants in 40 ms
[2021-05-16 15:41:31] [INFO ] Dead Transitions using invariants and state equation in 557 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 42894 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:31] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 1206 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:41:31] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 15:41:31] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:41:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 5 ms returned sat
[2021-05-16 15:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:31] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-16 15:41:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:41:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:41:31] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:32] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-16 15:41:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:41:33] [INFO ] [Nat]Added 1010 Read/Feed constraints in 916 ms returned sat
[2021-05-16 15:41:33] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 0 ms to minimize.
[2021-05-16 15:41:33] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 0 ms to minimize.
[2021-05-16 15:41:33] [INFO ] Deduced a trap composed of 77 places in 335 ms of which 0 ms to minimize.
[2021-05-16 15:41:34] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 0 ms to minimize.
[2021-05-16 15:41:34] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 0 ms to minimize.
[2021-05-16 15:41:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1809 ms
[2021-05-16 15:41:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2021-05-16 15:41:35] [INFO ] Added : 0 causal constraints over 0 iterations in 262 ms. Result :sat
Minimization took 1711 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 210 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:41:37] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:41:38] [INFO ] Dead Transitions using invariants and state equation in 1286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:41:38] [INFO ] Computed 39 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 119205 resets, run finished after 10337 ms. (steps per millisecond=96 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10359 resets, run finished after 1183 ms. (steps per millisecond=845 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:41:49] [INFO ] Computed 39 place invariants in 34 ms
[2021-05-16 15:41:50] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 15:41:50] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2021-05-16 15:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:50] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2021-05-16 15:41:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:41:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 97 ms returned sat
[2021-05-16 15:41:50] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-16 15:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:41:51] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2021-05-16 15:41:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:41:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 963 ms returned sat
[2021-05-16 15:41:52] [INFO ] Deduced a trap composed of 55 places in 407 ms of which 0 ms to minimize.
[2021-05-16 15:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2021-05-16 15:41:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 233 ms.
[2021-05-16 15:41:53] [INFO ] Added : 0 causal constraints over 0 iterations in 407 ms. Result :sat
Minimization took 1398 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 73000 steps, including 10489 resets, run finished after 814 ms. (steps per millisecond=89 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 132 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 83 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:41:55] [INFO ] Computed 39 place invariants in 45 ms
[2021-05-16 15:41:56] [INFO ] Implicit Places using invariants in 638 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 657 ms to find 10 implicit places.
[2021-05-16 15:41:56] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:41:56] [INFO ] Computed 29 place invariants in 18 ms
[2021-05-16 15:41:57] [INFO ] Dead Transitions using invariants and state equation in 1417 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 223 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:41:58] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:41:58] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:41:58] [INFO ] Computed 29 place invariants in 26 ms
[2021-05-16 15:42:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:42:06] [INFO ] Implicit Places using invariants and state equation in 7403 ms returned []
Implicit Place search using SMT with State Equation took 7964 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:42:06] [INFO ] Computed 29 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 178855 resets, run finished after 13035 ms. (steps per millisecond=76 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:42:20] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:42:20] [INFO ] [Real]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-16 15:42:20] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 126 ms returned sat
[2021-05-16 15:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:21] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2021-05-16 15:42:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:42:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-16 15:42:22] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 7 ms returned sat
[2021-05-16 15:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:22] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2021-05-16 15:42:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:42:23] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1038 ms returned sat
[2021-05-16 15:42:24] [INFO ] Deduced a trap composed of 59 places in 1117 ms of which 0 ms to minimize.
[2021-05-16 15:42:25] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 0 ms to minimize.
[2021-05-16 15:42:25] [INFO ] Deduced a trap composed of 69 places in 328 ms of which 0 ms to minimize.
[2021-05-16 15:42:26] [INFO ] Deduced a trap composed of 81 places in 370 ms of which 1 ms to minimize.
[2021-05-16 15:42:26] [INFO ] Deduced a trap composed of 75 places in 472 ms of which 1 ms to minimize.
[2021-05-16 15:42:27] [INFO ] Deduced a trap composed of 67 places in 377 ms of which 0 ms to minimize.
[2021-05-16 15:42:27] [INFO ] Deduced a trap composed of 80 places in 370 ms of which 0 ms to minimize.
[2021-05-16 15:42:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3922 ms
[2021-05-16 15:42:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 188 ms.
[2021-05-16 15:42:27] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 1841 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 318100 steps, including 66277 resets, run finished after 4450 ms. (steps per millisecond=71 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 82 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 81 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:42:34] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 15:42:34] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:42:34] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-16 15:42:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:42:38] [INFO ] Implicit Places using invariants and state equation in 3554 ms returned []
Implicit Place search using SMT with State Equation took 3904 ms to find 0 implicit places.
[2021-05-16 15:42:38] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:42:38] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:42:38] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 67597 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:42:38] [INFO ] Computed 39 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 1202 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:42:39] [INFO ] Computed 39 place invariants in 31 ms
[2021-05-16 15:42:39] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2021-05-16 15:42:39] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:39] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2021-05-16 15:42:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:42:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:42:39] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 5 ms returned sat
[2021-05-16 15:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:39] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-16 15:42:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:42:40] [INFO ] [Nat]Added 1010 Read/Feed constraints in 970 ms returned sat
[2021-05-16 15:42:40] [INFO ] Deduced a trap composed of 70 places in 262 ms of which 1 ms to minimize.
[2021-05-16 15:42:41] [INFO ] Deduced a trap composed of 74 places in 370 ms of which 0 ms to minimize.
[2021-05-16 15:42:41] [INFO ] Deduced a trap composed of 77 places in 395 ms of which 1 ms to minimize.
[2021-05-16 15:42:42] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 1 ms to minimize.
[2021-05-16 15:42:42] [INFO ] Deduced a trap composed of 73 places in 274 ms of which 0 ms to minimize.
[2021-05-16 15:42:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2237 ms
[2021-05-16 15:42:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 254 ms.
[2021-05-16 15:42:43] [INFO ] Added : 0 causal constraints over 0 iterations in 446 ms. Result :sat
Minimization took 1058 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 204 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:42:44] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 15:42:45] [INFO ] Dead Transitions using invariants and state equation in 538 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:42:45] [INFO ] Computed 39 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 119396 resets, run finished after 9713 ms. (steps per millisecond=102 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10343 resets, run finished after 1288 ms. (steps per millisecond=776 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:42:56] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:42:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-16 15:42:56] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-16 15:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:56] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-16 15:42:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:42:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2021-05-16 15:42:56] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2021-05-16 15:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:42:57] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2021-05-16 15:42:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:42:58] [INFO ] [Nat]Added 1010 Read/Feed constraints in 989 ms returned sat
[2021-05-16 15:42:58] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 0 ms to minimize.
[2021-05-16 15:42:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 558 ms
[2021-05-16 15:42:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 201 ms.
[2021-05-16 15:42:59] [INFO ] Added : 0 causal constraints over 0 iterations in 321 ms. Result :sat
Minimization took 1205 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 73000 steps, including 10460 resets, run finished after 770 ms. (steps per millisecond=94 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 132 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 106 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:43:01] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:43:02] [INFO ] Implicit Places using invariants in 1036 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 10 implicit places.
[2021-05-16 15:43:02] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:43:02] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:43:03] [INFO ] Dead Transitions using invariants and state equation in 643 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 279 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:03] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:43:03] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:04] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 15:43:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:43:09] [INFO ] Implicit Places using invariants and state equation in 5621 ms returned []
Implicit Place search using SMT with State Equation took 6133 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:09] [INFO ] Computed 29 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 178843 resets, run finished after 13058 ms. (steps per millisecond=76 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:23] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:43:24] [INFO ] [Real]Absence check using 10 positive place invariants in 69 ms returned sat
[2021-05-16 15:43:24] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 93 ms returned sat
[2021-05-16 15:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:43:25] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2021-05-16 15:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:43:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-16 15:43:25] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2021-05-16 15:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:43:25] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2021-05-16 15:43:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:43:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1031 ms returned sat
[2021-05-16 15:43:27] [INFO ] Deduced a trap composed of 59 places in 875 ms of which 0 ms to minimize.
[2021-05-16 15:43:28] [INFO ] Deduced a trap composed of 55 places in 331 ms of which 1 ms to minimize.
[2021-05-16 15:43:28] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 1 ms to minimize.
[2021-05-16 15:43:28] [INFO ] Deduced a trap composed of 81 places in 229 ms of which 0 ms to minimize.
[2021-05-16 15:43:29] [INFO ] Deduced a trap composed of 75 places in 354 ms of which 1 ms to minimize.
[2021-05-16 15:43:29] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 8 ms to minimize.
[2021-05-16 15:43:29] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 1 ms to minimize.
[2021-05-16 15:43:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3146 ms
[2021-05-16 15:43:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 235 ms.
[2021-05-16 15:43:30] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 1775 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 318100 steps, including 66326 resets, run finished after 4760 ms. (steps per millisecond=66 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 102 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 96 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:37] [INFO ] Computed 29 place invariants in 19 ms
[2021-05-16 15:43:37] [INFO ] Implicit Places using invariants in 454 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:37] [INFO ] Computed 29 place invariants in 18 ms
[2021-05-16 15:43:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:43:43] [INFO ] Implicit Places using invariants and state equation in 5505 ms returned []
Implicit Place search using SMT with State Equation took 6008 ms to find 0 implicit places.
[2021-05-16 15:43:43] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:43:43] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 15:43:44] [INFO ] Dead Transitions using invariants and state equation in 1184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04 in 65607 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:43:44] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 1184 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:43:44] [INFO ] Computed 39 place invariants in 42 ms
[2021-05-16 15:43:44] [INFO ] [Real]Absence check using 12 positive place invariants in 62 ms returned sat
[2021-05-16 15:43:44] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 156 ms returned sat
[2021-05-16 15:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:43:45] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-16 15:43:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:43:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-16 15:43:45] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-16 15:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:43:46] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2021-05-16 15:43:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:43:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1044 ms returned sat
[2021-05-16 15:43:49] [INFO ] Deduced a trap composed of 76 places in 1961 ms of which 0 ms to minimize.
[2021-05-16 15:43:52] [INFO ] Deduced a trap composed of 51 places in 2673 ms of which 0 ms to minimize.
[2021-05-16 15:43:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 168 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:43:52] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 15:43:53] [INFO ] Dead Transitions using invariants and state equation in 1426 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:43:53] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 119307 resets, run finished after 9690 ms. (steps per millisecond=103 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:44:04] [INFO ] Computed 39 place invariants in 34 ms
[2021-05-16 15:44:04] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 15:44:04] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2021-05-16 15:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:05] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-05-16 15:44:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:44:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-16 15:44:05] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-16 15:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:06] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-16 15:44:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:44:07] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1032 ms returned sat
[2021-05-16 15:44:08] [INFO ] Deduced a trap composed of 59 places in 1666 ms of which 0 ms to minimize.
[2021-05-16 15:44:09] [INFO ] Deduced a trap composed of 55 places in 766 ms of which 3 ms to minimize.
[2021-05-16 15:44:10] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 0 ms to minimize.
[2021-05-16 15:44:10] [INFO ] Deduced a trap composed of 49 places in 401 ms of which 0 ms to minimize.
[2021-05-16 15:44:11] [INFO ] Deduced a trap composed of 55 places in 370 ms of which 1 ms to minimize.
[2021-05-16 15:44:11] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 1 ms to minimize.
[2021-05-16 15:44:11] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 0 ms to minimize.
[2021-05-16 15:44:11] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 1 ms to minimize.
[2021-05-16 15:44:12] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 0 ms to minimize.
[2021-05-16 15:44:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5440 ms
[2021-05-16 15:44:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 164 ms.
[2021-05-16 15:44:12] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 1400 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 59200 steps, including 7966 resets, run finished after 639 ms. (steps per millisecond=92 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 82 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 82 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:44:15] [INFO ] Computed 39 place invariants in 31 ms
[2021-05-16 15:44:16] [INFO ] Implicit Places using invariants in 993 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 10 implicit places.
[2021-05-16 15:44:16] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:16] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:44:16] [INFO ] Dead Transitions using invariants and state equation in 654 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 82 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 15:44:17] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:17] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:44:18] [INFO ] Dead Transitions using invariants and state equation in 1291 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:18] [INFO ] Computed 29 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 119321 resets, run finished after 9594 ms. (steps per millisecond=104 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9743 resets, run finished after 1259 ms. (steps per millisecond=794 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:29] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:44:29] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 15:44:29] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 15:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:29] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2021-05-16 15:44:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:44:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-16 15:44:29] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 15:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:30] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2021-05-16 15:44:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:44:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 983 ms returned sat
[2021-05-16 15:44:32] [INFO ] Deduced a trap composed of 49 places in 496 ms of which 1 ms to minimize.
[2021-05-16 15:44:32] [INFO ] Deduced a trap composed of 71 places in 417 ms of which 1 ms to minimize.
[2021-05-16 15:44:33] [INFO ] Deduced a trap composed of 49 places in 446 ms of which 0 ms to minimize.
[2021-05-16 15:44:33] [INFO ] Deduced a trap composed of 73 places in 472 ms of which 0 ms to minimize.
[2021-05-16 15:44:34] [INFO ] Deduced a trap composed of 80 places in 241 ms of which 0 ms to minimize.
[2021-05-16 15:44:34] [INFO ] Deduced a trap composed of 65 places in 405 ms of which 1 ms to minimize.
[2021-05-16 15:44:35] [INFO ] Deduced a trap composed of 53 places in 446 ms of which 1 ms to minimize.
[2021-05-16 15:44:35] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 0 ms to minimize.
[2021-05-16 15:44:36] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 0 ms to minimize.
[2021-05-16 15:44:36] [INFO ] Deduced a trap composed of 47 places in 389 ms of which 1 ms to minimize.
[2021-05-16 15:44:36] [INFO ] Deduced a trap composed of 65 places in 404 ms of which 0 ms to minimize.
[2021-05-16 15:44:38] [INFO ] Deduced a trap composed of 55 places in 1080 ms of which 0 ms to minimize.
[2021-05-16 15:44:38] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 0 ms to minimize.
[2021-05-16 15:44:38] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 0 ms to minimize.
[2021-05-16 15:44:39] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 0 ms to minimize.
[2021-05-16 15:44:39] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 0 ms to minimize.
[2021-05-16 15:44:39] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 1 ms to minimize.
[2021-05-16 15:44:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8312 ms
[2021-05-16 15:44:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 201 ms.
[2021-05-16 15:44:40] [INFO ] Added : 0 causal constraints over 0 iterations in 371 ms. Result :sat
Minimization took 1335 ms.
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Incomplete Parikh walk after 64100 steps, including 8283 resets, run finished after 680 ms. (steps per millisecond=94 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:42] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:44:42] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:42] [INFO ] Computed 29 place invariants in 26 ms
[2021-05-16 15:44:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:44:47] [INFO ] Implicit Places using invariants and state equation in 4821 ms returned []
Implicit Place search using SMT with State Equation took 5236 ms to find 0 implicit places.
[2021-05-16 15:44:47] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:44:47] [INFO ] Computed 29 place invariants in 26 ms
[2021-05-16 15:44:50] [INFO ] Dead Transitions using invariants and state equation in 2538 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 65927 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:44:50] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:44:50] [INFO ] Computed 39 place invariants in 34 ms
[2021-05-16 15:44:50] [INFO ] [Real]Absence check using 12 positive place invariants in 66 ms returned sat
[2021-05-16 15:44:50] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 125 ms returned sat
[2021-05-16 15:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:52] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2021-05-16 15:44:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:44:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:44:52] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2021-05-16 15:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:44:53] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2021-05-16 15:44:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:44:54] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1101 ms returned sat
[2021-05-16 15:44:54] [INFO ] Deduced a trap composed of 68 places in 638 ms of which 0 ms to minimize.
[2021-05-16 15:44:55] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 1 ms to minimize.
[2021-05-16 15:44:55] [INFO ] Deduced a trap composed of 72 places in 387 ms of which 1 ms to minimize.
[2021-05-16 15:44:56] [INFO ] Deduced a trap composed of 72 places in 709 ms of which 2 ms to minimize.
[2021-05-16 15:44:57] [INFO ] Deduced a trap composed of 46 places in 432 ms of which 0 ms to minimize.
[2021-05-16 15:44:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 174 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:44:57] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:44:58] [INFO ] Dead Transitions using invariants and state equation in 1066 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:44:58] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 119309 resets, run finished after 10120 ms. (steps per millisecond=98 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9403 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:45:11] [INFO ] Computed 39 place invariants in 46 ms
[2021-05-16 15:45:11] [INFO ] [Real]Absence check using 14 positive place invariants in 61 ms returned sat
[2021-05-16 15:45:11] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 133 ms returned sat
[2021-05-16 15:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:45:11] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-16 15:45:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:45:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-16 15:45:11] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-16 15:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:45:12] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-16 15:45:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:45:13] [INFO ] [Nat]Added 1010 Read/Feed constraints in 946 ms returned sat
[2021-05-16 15:45:13] [INFO ] Deduced a trap composed of 69 places in 275 ms of which 0 ms to minimize.
[2021-05-16 15:45:14] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 1 ms to minimize.
[2021-05-16 15:45:15] [INFO ] Deduced a trap composed of 75 places in 1414 ms of which 0 ms to minimize.
[2021-05-16 15:45:16] [INFO ] Deduced a trap composed of 49 places in 421 ms of which 1 ms to minimize.
[2021-05-16 15:45:16] [INFO ] Deduced a trap composed of 39 places in 441 ms of which 1 ms to minimize.
[2021-05-16 15:45:17] [INFO ] Deduced a trap composed of 59 places in 422 ms of which 1 ms to minimize.
[2021-05-16 15:45:18] [INFO ] Deduced a trap composed of 37 places in 1142 ms of which 0 ms to minimize.
[2021-05-16 15:45:19] [INFO ] Deduced a trap composed of 75 places in 409 ms of which 0 ms to minimize.
[2021-05-16 15:45:19] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 0 ms to minimize.
[2021-05-16 15:45:20] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 0 ms to minimize.
[2021-05-16 15:45:20] [INFO ] Deduced a trap composed of 49 places in 358 ms of which 0 ms to minimize.
[2021-05-16 15:45:20] [INFO ] Deduced a trap composed of 59 places in 263 ms of which 1 ms to minimize.
[2021-05-16 15:45:21] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 0 ms to minimize.
[2021-05-16 15:45:21] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 0 ms to minimize.
[2021-05-16 15:45:21] [INFO ] Deduced a trap composed of 57 places in 290 ms of which 0 ms to minimize.
[2021-05-16 15:45:22] [INFO ] Deduced a trap composed of 81 places in 257 ms of which 0 ms to minimize.
[2021-05-16 15:45:22] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 8875 ms
[2021-05-16 15:45:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 204 ms.
[2021-05-16 15:45:22] [INFO ] Added : 0 causal constraints over 0 iterations in 328 ms. Result :sat
Minimization took 1426 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 162800 steps, including 1002 resets, run finished after 889 ms. (steps per millisecond=183 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 80 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 115 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:45:25] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:45:25] [INFO ] Implicit Places using invariants in 326 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 343 ms to find 10 implicit places.
[2021-05-16 15:45:25] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:45:25] [INFO ] Computed 29 place invariants in 25 ms
[2021-05-16 15:45:27] [INFO ] Dead Transitions using invariants and state equation in 2003 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 195 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:45:27] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:45:28] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:45:28] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:45:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:45:29] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:45:30] [INFO ] Computed 29 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 178960 resets, run finished after 13705 ms. (steps per millisecond=72 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:45:45] [INFO ] Computed 29 place invariants in 19 ms
[2021-05-16 15:45:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-16 15:45:45] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2021-05-16 15:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:45:45] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-16 15:45:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:45:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-16 15:45:46] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2021-05-16 15:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:45:46] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-16 15:45:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:45:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 848 ms returned sat
[2021-05-16 15:45:47] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 1 ms to minimize.
[2021-05-16 15:45:48] [INFO ] Deduced a trap composed of 67 places in 363 ms of which 1 ms to minimize.
[2021-05-16 15:45:48] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 0 ms to minimize.
[2021-05-16 15:45:48] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 0 ms to minimize.
[2021-05-16 15:45:49] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 0 ms to minimize.
[2021-05-16 15:45:49] [INFO ] Deduced a trap composed of 71 places in 379 ms of which 1 ms to minimize.
[2021-05-16 15:45:50] [INFO ] Deduced a trap composed of 59 places in 350 ms of which 0 ms to minimize.
[2021-05-16 15:45:50] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 1 ms to minimize.
[2021-05-16 15:45:50] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 0 ms to minimize.
[2021-05-16 15:45:51] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 0 ms to minimize.
[2021-05-16 15:45:51] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 0 ms to minimize.
[2021-05-16 15:45:51] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 0 ms to minimize.
[2021-05-16 15:45:52] [INFO ] Deduced a trap composed of 30 places in 576 ms of which 1 ms to minimize.
[2021-05-16 15:45:54] [INFO ] Deduced a trap composed of 39 places in 2049 ms of which 6 ms to minimize.
[2021-05-16 15:45:55] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 0 ms to minimize.
[2021-05-16 15:45:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 7993 ms
[2021-05-16 15:45:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 242 ms.
[2021-05-16 15:45:55] [INFO ] Added : 0 causal constraints over 0 iterations in 375 ms. Result :sat
Minimization took 1965 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 222500 steps, including 46429 resets, run finished after 3531 ms. (steps per millisecond=63 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 93 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 93 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:46:01] [INFO ] Computed 29 place invariants in 20 ms
[2021-05-16 15:46:01] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:46:01] [INFO ] Computed 29 place invariants in 19 ms
[2021-05-16 15:46:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:46:04] [INFO ] Implicit Places using invariants and state equation in 2718 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
[2021-05-16 15:46:04] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 15:46:04] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:46:04] [INFO ] Dead Transitions using invariants and state equation in 526 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 74527 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:04] [INFO ] Computed 39 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:05] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:46:05] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:46:05] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:05] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-16 15:46:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:46:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:46:05] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:46:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:05] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2021-05-16 15:46:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:46:06] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1064 ms returned sat
[2021-05-16 15:46:07] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 0 ms to minimize.
[2021-05-16 15:46:07] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 1 ms to minimize.
[2021-05-16 15:46:08] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 0 ms to minimize.
[2021-05-16 15:46:08] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 0 ms to minimize.
[2021-05-16 15:46:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1611 ms
[2021-05-16 15:46:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 248 ms.
[2021-05-16 15:46:08] [INFO ] Added : 0 causal constraints over 0 iterations in 436 ms. Result :sat
Minimization took 1548 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:10] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:46:11] [INFO ] Dead Transitions using invariants and state equation in 1413 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:12] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 119352 resets, run finished after 9441 ms. (steps per millisecond=105 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7071 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:22] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:46:22] [INFO ] [Real]Absence check using 12 positive place invariants in 70 ms returned sat
[2021-05-16 15:46:22] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 151 ms returned sat
[2021-05-16 15:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:24] [INFO ] [Real]Absence check using state equation in 1488 ms returned sat
[2021-05-16 15:46:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:46:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-16 15:46:24] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-16 15:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:24] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2021-05-16 15:46:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:46:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1064 ms returned sat
[2021-05-16 15:46:26] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 1 ms to minimize.
[2021-05-16 15:46:26] [INFO ] Deduced a trap composed of 51 places in 279 ms of which 0 ms to minimize.
[2021-05-16 15:46:27] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 0 ms to minimize.
[2021-05-16 15:46:27] [INFO ] Deduced a trap composed of 70 places in 287 ms of which 1 ms to minimize.
[2021-05-16 15:46:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1773 ms
[2021-05-16 15:46:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 242 ms.
[2021-05-16 15:46:28] [INFO ] Added : 0 causal constraints over 0 iterations in 375 ms. Result :sat
Minimization took 1677 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 303900 steps, including 33083 resets, run finished after 3253 ms. (steps per millisecond=93 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:33] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:46:33] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:33] [INFO ] Computed 39 place invariants in 30 ms
[2021-05-16 15:46:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:46:42] [INFO ] Implicit Places using invariants and state equation in 8525 ms returned []
Implicit Place search using SMT with State Equation took 8875 ms to find 0 implicit places.
[2021-05-16 15:46:42] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:42] [INFO ] Computed 39 place invariants in 34 ms
[2021-05-16 15:46:44] [INFO ] Dead Transitions using invariants and state equation in 1969 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 39427 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-09
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:44] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:46:44] [INFO ] Computed 39 place invariants in 32 ms
[2021-05-16 15:46:44] [INFO ] [Real]Absence check using 12 positive place invariants in 51 ms returned sat
[2021-05-16 15:46:44] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 164 ms returned sat
[2021-05-16 15:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:45] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2021-05-16 15:46:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:46:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:46:45] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2021-05-16 15:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:46:46] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2021-05-16 15:46:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:46:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1459 ms returned sat
[2021-05-16 15:46:48] [INFO ] Deduced a trap composed of 67 places in 355 ms of which 0 ms to minimize.
[2021-05-16 15:46:48] [INFO ] Deduced a trap composed of 60 places in 486 ms of which 0 ms to minimize.
[2021-05-16 15:46:48] [INFO ] Deduced a trap composed of 60 places in 275 ms of which 0 ms to minimize.
[2021-05-16 15:46:49] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 0 ms to minimize.
[2021-05-16 15:46:49] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 1 ms to minimize.
[2021-05-16 15:46:50] [INFO ] Deduced a trap composed of 70 places in 375 ms of which 0 ms to minimize.
[2021-05-16 15:46:50] [INFO ] Deduced a trap composed of 74 places in 339 ms of which 0 ms to minimize.
[2021-05-16 15:46:51] [INFO ] Deduced a trap composed of 65 places in 347 ms of which 0 ms to minimize.
[2021-05-16 15:46:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 170 transition count 1876
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 161 transition count 1876
Applied a total of 18 rules in 166 ms. Remains 161 /170 variables (removed 9) and now considering 1876/1885 (removed 9) transitions.
// Phase 1: matrix 1876 rows 161 cols
[2021-05-16 15:46:51] [INFO ] Computed 39 place invariants in 38 ms
[2021-05-16 15:46:51] [INFO ] Dead Transitions using invariants and state equation in 660 ms returned []
Finished structural reductions, in 1 iterations. Remains : 161/170 places, 1876/1885 transitions.
// Phase 1: matrix 1876 rows 161 cols
[2021-05-16 15:46:51] [INFO ] Computed 39 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 119349 resets, run finished after 9356 ms. (steps per millisecond=106 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9267 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties (out of 1) seen :1
// Phase 1: matrix 1876 rows 161 cols
[2021-05-16 15:47:02] [INFO ] Computed 39 place invariants in 52 ms
[2021-05-16 15:47:02] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 15:47:02] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 154 ms returned sat
[2021-05-16 15:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:47:03] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2021-05-16 15:47:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:47:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-16 15:47:03] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2021-05-16 15:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:47:03] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-16 15:47:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:47:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1025 ms returned sat
[2021-05-16 15:47:05] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 0 ms to minimize.
[2021-05-16 15:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2021-05-16 15:47:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1831 transitions) in 297 ms.
[2021-05-16 15:47:05] [INFO ] Added : 0 causal constraints over 0 iterations in 494 ms. Result :sat
Minimization took 1395 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 69800 steps, including 1002 resets, run finished after 375 ms. (steps per millisecond=186 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 1876/1876 transitions.
Applied a total of 0 rules in 127 ms. Remains 161 /161 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 1876/1876 transitions.
Starting structural reductions, iteration 0 : 161/161 places, 1876/1876 transitions.
Applied a total of 0 rules in 90 ms. Remains 161 /161 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
// Phase 1: matrix 1876 rows 161 cols
[2021-05-16 15:47:08] [INFO ] Computed 39 place invariants in 54 ms
[2021-05-16 15:47:08] [INFO ] Implicit Places using invariants in 619 ms returned [2, 37, 57, 73, 90, 96, 106, 138, 157]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 639 ms to find 9 implicit places.
[2021-05-16 15:47:08] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1876 rows 152 cols
[2021-05-16 15:47:08] [INFO ] Computed 30 place invariants in 41 ms
[2021-05-16 15:47:09] [INFO ] Dead Transitions using invariants and state equation in 1122 ms returned []
Starting structural reductions, iteration 1 : 152/161 places, 1876/1876 transitions.
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 1867
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 143 transition count 1867
Applied a total of 18 rules in 165 ms. Remains 143 /152 variables (removed 9) and now considering 1867/1876 (removed 9) transitions.
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:10] [INFO ] Computed 30 place invariants in 36 ms
[2021-05-16 15:47:10] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:10] [INFO ] Computed 30 place invariants in 27 ms
[2021-05-16 15:47:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:47:15] [INFO ] Implicit Places using invariants and state equation in 5244 ms returned []
Implicit Place search using SMT with State Equation took 5572 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 143/161 places, 1867/1876 transitions.
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:15] [INFO ] Computed 30 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 169883 resets, run finished after 12914 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 10749 resets, run finished after 1235 ms. (steps per millisecond=809 ) properties (out of 1) seen :1
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:29] [INFO ] Computed 30 place invariants in 17 ms
[2021-05-16 15:47:29] [INFO ] [Real]Absence check using 12 positive place invariants in 51 ms returned sat
[2021-05-16 15:47:30] [INFO ] [Real]Absence check using 12 positive and 18 generalized place invariants in 119 ms returned sat
[2021-05-16 15:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:47:31] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2021-05-16 15:47:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:47:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:47:31] [INFO ] [Nat]Absence check using 12 positive and 18 generalized place invariants in 7 ms returned sat
[2021-05-16 15:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:47:31] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2021-05-16 15:47:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:47:32] [INFO ] [Nat]Added 1010 Read/Feed constraints in 889 ms returned sat
[2021-05-16 15:47:33] [INFO ] Deduced a trap composed of 62 places in 424 ms of which 0 ms to minimize.
[2021-05-16 15:47:33] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 0 ms to minimize.
[2021-05-16 15:47:34] [INFO ] Deduced a trap composed of 59 places in 434 ms of which 0 ms to minimize.
[2021-05-16 15:47:37] [INFO ] Deduced a trap composed of 67 places in 2563 ms of which 23 ms to minimize.
[2021-05-16 15:47:37] [INFO ] Deduced a trap composed of 65 places in 659 ms of which 26 ms to minimize.
[2021-05-16 15:47:38] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 1 ms to minimize.
[2021-05-16 15:47:38] [INFO ] Deduced a trap composed of 55 places in 475 ms of which 0 ms to minimize.
[2021-05-16 15:47:39] [INFO ] Deduced a trap composed of 69 places in 440 ms of which 1 ms to minimize.
[2021-05-16 15:47:39] [INFO ] Deduced a trap composed of 53 places in 440 ms of which 1 ms to minimize.
[2021-05-16 15:47:40] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 1 ms to minimize.
[2021-05-16 15:47:41] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 0 ms to minimize.
[2021-05-16 15:47:41] [INFO ] Deduced a trap composed of 48 places in 429 ms of which 1 ms to minimize.
[2021-05-16 15:47:42] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 0 ms to minimize.
[2021-05-16 15:47:42] [INFO ] Deduced a trap composed of 63 places in 444 ms of which 0 ms to minimize.
[2021-05-16 15:47:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9947 ms
[2021-05-16 15:47:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1822 transitions) in 284 ms.
[2021-05-16 15:47:43] [INFO ] Added : 0 causal constraints over 0 iterations in 459 ms. Result :sat
Minimization took 2458 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 314000 steps, including 57697 resets, run finished after 4719 ms. (steps per millisecond=66 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 1867/1867 transitions.
Applied a total of 0 rules in 110 ms. Remains 143 /143 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1867/1867 transitions.
Starting structural reductions, iteration 0 : 143/143 places, 1867/1867 transitions.
Applied a total of 0 rules in 103 ms. Remains 143 /143 variables (removed 0) and now considering 1867/1867 (removed 0) transitions.
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:50] [INFO ] Computed 30 place invariants in 17 ms
[2021-05-16 15:47:51] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:47:51] [INFO ] Computed 30 place invariants in 24 ms
[2021-05-16 15:47:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:48:00] [INFO ] Implicit Places using invariants and state equation in 9487 ms returned []
Implicit Place search using SMT with State Equation took 9989 ms to find 0 implicit places.
[2021-05-16 15:48:00] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1867 rows 143 cols
[2021-05-16 15:48:00] [INFO ] Computed 30 place invariants in 31 ms
[2021-05-16 15:48:02] [INFO ] Dead Transitions using invariants and state equation in 1295 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1867/1867 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-09 in 77766 ms.
[2021-05-16 15:48:03] [INFO ] Flatten gal took : 731 ms
[2021-05-16 15:48:03] [INFO ] Applying decomposition
[2021-05-16 15:48:04] [INFO ] Flatten gal took : 489 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18287796998652123944.txt, -o, /tmp/graph18287796998652123944.bin, -w, /tmp/graph18287796998652123944.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18287796998652123944.bin, -l, -1, -v, -w, /tmp/graph18287796998652123944.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:48:05] [INFO ] Decomposing Gal with order
[2021-05-16 15:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:48:07] [INFO ] Removed a total of 2660 redundant transitions.
[2021-05-16 15:48:08] [INFO ] Flatten gal took : 2182 ms
[2021-05-16 15:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 82 ms.
[2021-05-16 15:48:08] [INFO ] Time to serialize gal into /tmp/UpperBounds5864483930904419293.gal : 68 ms
[2021-05-16 15:48:09] [INFO ] Time to serialize properties into /tmp/UpperBounds14364538092031988684.prop : 50 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5864483930904419293.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14364538092031988684.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5864483930904419293.gal -t CGAL -reachable-file /tmp/UpperBounds14364538092031988684.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds14364538092031988684.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\_flatf,199051,209.779,2382948,2,218229,5,2.82544e+06,6,0,2588,833607,0
Total reachable state count : 199051

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-00 :0 <= gu0.Forks_10+gu8.Forks_8+gu2.Forks_1+gu5.Forks_7+gu6.Forks_6+gu7.Forks_5+gu1.Forks_4+gu4.Forks_3+gu9.Forks_9+gu3.Forks_2 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-00 2 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
PhilosophersDyn-PT-10-UpperBounds-00,0,210.048,2382948,1,0,7,2.82544e+06,9,1,3042,833607,4
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-01 :0 <= gu9.Think_9+gu8.Think_8+gu2.Think_1+gu3.Think_2+gu4.Think_3+gu5.Think_7+gu6.Think_6+gu1.Think_4+gu7.Think_5+gu0.Think_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-01 4 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
PhilosophersDyn-PT-10-UpperBounds-01,0,210.324,2382948,1,0,8,2.82544e+06,10,1,3330,833607,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-02 :0 <= gu5.WaitLeft_7+gu1.WaitLeft_4+gu0.WaitLeft_10+gu7.WaitLeft_5+gu3.WaitLeft_2+gu4.WaitLeft_3+gu2.WaitLeft_1+gu8.WaitLeft_8+gu9.WaitLeft_9+gu6.WaitLeft_6 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 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
PhilosophersDyn-PT-10-UpperBounds-02,0,210.658,2382948,1,0,9,2.82544e+06,11,1,3681,833607,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-03 :0 <= gu9.HasRight_9+gu3.HasRight_2+gu4.HasRight_3+gu8.HasRight_8+gu2.HasRight_1+gu0.HasRight_10+gu6.HasRight_6+gu5.HasRight_7+gu1.HasRight_4+gu7.HasRight_5 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 2 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
PhilosophersDyn-PT-10-UpperBounds-03,0,211.039,2382948,1,0,10,2.82544e+06,12,1,4025,833607,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-04 :0 <= gu9.HasRight_9+gu3.HasRight_2+gu4.HasRight_3+gu8.HasRight_8+gu2.HasRight_1+gu0.HasRight_10+gu6.HasRight_6+gu5.HasRight_7+gu1.HasRight_4+gu7.HasRight_5 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 2 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
PhilosophersDyn-PT-10-UpperBounds-04,0,211.039,2382948,1,0,10,2.82544e+06,12,1,4025,833607,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-05 :0 <= gu9.Think_9+gu8.Think_8+gu2.Think_1+gu3.Think_2+gu4.Think_3+gu5.Think_7+gu6.Think_6+gu1.Think_4+gu7.Think_5+gu0.Think_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-05 4 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
PhilosophersDyn-PT-10-UpperBounds-05,0,211.04,2382948,1,0,10,2.82544e+06,12,1,4025,833607,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-06 :0 <= gu5.Neighbourhood_7_3+gu3.Neighbourhood_2_10+gu9.Neighbourhood_9_1+gu4.Neighbourhood_3_8+gu8.Neighbourhood_8_2+gu7.Neighbourhood_5_5+gu8.Neighbourhood_8_9+gu4.Neighbourhood_3_4+gu5.Neighbourhood_7_7+gu4.Neighbourhood_3_6+gu1.Neighbourhood_4_8+gu7.Neighbourhood_5_10+gu7.Neighbourhood_5_1+gu6.Neighbourhood_6_5+gu2.Neighbourhood_1_9+gu2.Neighbourhood_1_7+gu6.Neighbourhood_6_3+gu9.Neighbourhood_9_2+gu3.Neighbourhood_2_2+gu0.Neighbourhood_10_4+gu5.Neighbourhood_7_5+gu2.Neighbourhood_1_2+gu7.Neighbourhood_5_8+gu6.Neighbourhood_6_1+gu9.Neighbourhood_9_9+gu3.Neighbourhood_2_7+gu6.Neighbourhood_6_7+gu0.Neighbourhood_10_2+gu1.Neighbourhood_4_4+gu3.Neighbourhood_2_6+gu7.Neighbourhood_5_3+gu1.Neighbourhood_4_10+gu4.Neighbourhood_3_1+gu9.Neighbourhood_9_4+gu9.Neighbourhood_9_7+gu8.Neighbourhood_8_5+gu1.Neighbourhood_4_3+gu6.Neighbourhood_6_8+gu9.Neighbourhood_9_6+gu0.Neighbourhood_10_8+gu2.Neighbourhood_1_6+gu9.Neighbourhood_9_8+gu2.Neighbourhood_1_4+gu6.Neighbourhood_6_9+gu5.Neighbourhood_7_10+gu8.Neighbourhood_8_7+gu5.Neighbourhood_7_8+gu1.Neighbourhood_4_1+gu6.Neighbourhood_6_10+gu1.Neighbourhood_4_2+gu4.Neighbourhood_3_3+gu2.Neighbourhood_1_5+gu3.Neighbourhood_2_4+gu8.Neighbourhood_8_8+gu5.Neighbourhood_7_9+gu0.Neighbourhood_10_6+gu0.Neighbourhood_10_5+gu4.Neighbourhood_3_2+gu9.Neighbourhood_9_3+gu1.Neighbourhood_4_7+gu6.Neighbourhood_6_4+gu3.Neighbourhood_2_3+gu7.Neighbourhood_5_2+gu6.Neighbourhood_6_6+gu8.Neighbourhood_8_1+gu0.Neighbourhood_10_3+gu3.Neighbourhood_2_5+gu2.Neighbourhood_1_1+gu0.Neighbourhood_10_7+gu2.Neighbourhood_1_3+gu9.Neighbourhood_9_5+gu5.Neighbourhood_7_1+gu4.Neighbourhood_3_7+gu8.Neighbourhood_8_6+gu6.Neighbourhood_6_2+gu7.Neighbourhood_5_4+gu8.Neighbourhood_8_10+gu7.Neighbourhood_5_9+gu9.Neighbourhood_9_10+gu1.Neighbourhood_4_9+gu5.Neighbourhood_7_6+gu3.Neighbourhood_2_1+gu2.Neighbourhood_1_8+gu4.Neighbourhood_3_5+gu0.Neighbourhood_10_9+gu4.Neighbourhood_3_9+gu8.Neighbourhood_8_4+gu7.Neighbourhood_5_6+gu0.Neighbourhood_10_1+gu5.Neighbourhood_7_2+gu1.Neighbourhood_4_5+gu3.Neighbourhood_2_8+gu0.Neighbourhood_10_10+gu1.Neighbourhood_4_6+gu5.Neighbourhood_7_4+gu8.Neighbourhood_8_3+gu2.Neighbourhood_1_10+gu3.Neighbourhood_2_9+gu7.Neighbourhood_5_7+gu4.Neighbourhood_3_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 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
PhilosophersDyn-PT-10-UpperBounds-06,0,211.493,2382948,1,0,11,2.82544e+06,13,1,4439,833607,8
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-07 :0 <= gu5.WaitLeft_7+gu1.WaitLeft_4+gu0.WaitLeft_10+gu7.WaitLeft_5+gu3.WaitLeft_2+gu4.WaitLeft_3+gu2.WaitLeft_1+gu8.WaitLeft_8+gu9.WaitLeft_9+gu6.WaitLeft_6 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-07 4 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
PhilosophersDyn-PT-10-UpperBounds-07,0,211.494,2382948,1,0,11,2.82544e+06,13,1,4439,833607,8
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PhilosophersDyn-PT-10-UpperBounds-09 :0 <= gu8.Forks_8 <= 1
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 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
PhilosophersDyn-PT-10-UpperBounds-09,0,211.583,2382948,1,0,12,2.82544e+06,14,1,4548,833607,9

BK_STOP 1621180302871

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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 r159-oct2-162089267800051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;