MCC'2023- Execution of r319-tall-167873969900033

About the Execution of 2022-gold for Philosophers-PT-005000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
7889.060	3600000.00	3766250.00	7774.70	5000 ? 5000 5000 ? 5000 ? 5000 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969900033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Philosophers-PT-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 226M
-rw-r--r-- 1 mcc users 8.4M Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43M Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2M Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1M Feb 26 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41M Feb 26 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9M Feb 26 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46M Feb 26 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 477K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-005000-UpperBounds-00
FORMULA_NAME Philosophers-PT-005000-UpperBounds-01
FORMULA_NAME Philosophers-PT-005000-UpperBounds-02
FORMULA_NAME Philosophers-PT-005000-UpperBounds-03
FORMULA_NAME Philosophers-PT-005000-UpperBounds-04
FORMULA_NAME Philosophers-PT-005000-UpperBounds-05
FORMULA_NAME Philosophers-PT-005000-UpperBounds-06
FORMULA_NAME Philosophers-PT-005000-UpperBounds-07
FORMULA_NAME Philosophers-PT-005000-UpperBounds-08
FORMULA_NAME Philosophers-PT-005000-UpperBounds-09
FORMULA_NAME Philosophers-PT-005000-UpperBounds-10
FORMULA_NAME Philosophers-PT-005000-UpperBounds-11
FORMULA_NAME Philosophers-PT-005000-UpperBounds-12
FORMULA_NAME Philosophers-PT-005000-UpperBounds-13
FORMULA_NAME Philosophers-PT-005000-UpperBounds-14
FORMULA_NAME Philosophers-PT-005000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678866806788

Running Version 202205111006
[2023-03-15 07:53:28] [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]
[2023-03-15 07:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:53:29] [INFO ] Load time of PNML (sax parser for PT used): 821 ms
[2023-03-15 07:53:29] [INFO ] Transformed 25000 places.
[2023-03-15 07:53:29] [INFO ] Transformed 25000 transitions.
[2023-03-15 07:53:29] [INFO ] Parsed PT model containing 25000 places and 25000 transitions in 1087 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4183 ms.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:53:34] [INFO ] Computed 10000 place invariants in 235 ms
FORMULA Philosophers-PT-005000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24757 ms. (steps per millisecond=0 ) properties (out of 10) seen :3570
FORMULA Philosophers-PT-005000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3056 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2766 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2676 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2927 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2792 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1541 ms. (steps per millisecond=6 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1576 ms. (steps per millisecond=6 ) properties (out of 7) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:54:16] [INFO ] Computed 10000 place invariants in 106 ms
[2023-03-15 07:54:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 1832 ms returned unknown
[2023-03-15 07:54:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 1995 ms returned unknown
[2023-03-15 07:54:31] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:54:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 1953 ms returned unknown
[2023-03-15 07:54:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 2143 ms returned unknown
[2023-03-15 07:54:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 185 ms returned unknown
[2023-03-15 07:54:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 2097 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 1, 1] Max seen :[1164, 413, 1164, 413, 413, 0, 0]
Support contains 10001 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 4999 times.
Iterating global reduction 0 with 4999 rules applied. Total rules applied 4999 place count 25000 transition count 20001
Reduce places removed 4999 places and 0 transitions.
Iterating post reduction 0 with 4999 rules applied. Total rules applied 9998 place count 20001 transition count 20001
Applied a total of 9998 rules in 9719 ms. Remains 20001 /25000 variables (removed 4999) and now considering 20001/25000 (removed 4999) transitions.
Finished structural reductions, in 1 iterations. Remains : 20001/25000 places, 20001/25000 transitions.
// Phase 1: matrix 20001 rows 20001 cols
[2023-03-15 07:55:01] [INFO ] Computed 10000 place invariants in 60 ms
Interrupted random walk after 14781 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen 10667
FORMULA Philosophers-PT-005000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5102 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 21999 steps, including 0 resets, run timeout after 5240 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5164 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 20999 steps, including 0 resets, run timeout after 5135 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 20999 steps, including 0 resets, run timeout after 5136 ms. (steps per millisecond=4 ) properties seen 8
Finished Best-First random walk after 36996 steps, including 0 resets, run visited all 6 properties in 5129 ms. (steps per millisecond=7 )
FORMULA Philosophers-PT-005000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 20001 rows 20001 cols
[2023-03-15 07:56:02] [INFO ] Computed 10000 place invariants in 49 ms
[2023-03-15 07:56:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 19337 ms returned sat
[2023-03-15 07:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:56:47] [INFO ] [Real]Absence check using state equation in 23731 ms returned unknown
[2023-03-15 07:56:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 9136 ms returned sat
[2023-03-15 07:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:57:32] [INFO ] [Real]Absence check using state equation in 33762 ms returned unknown
[2023-03-15 07:57:52] [INFO ] [Real]Absence check using 10000 positive place invariants in 17242 ms returned sat
[2023-03-15 07:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:58:18] [INFO ] [Real]Absence check using state equation in 25604 ms returned unknown
[2023-03-15 07:58:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 8276 ms returned sat
[2023-03-15 07:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:59:03] [INFO ] [Real]Absence check using state equation in 34699 ms returned unknown
[2023-03-15 07:59:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 8689 ms returned sat
[2023-03-15 07:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:59:48] [INFO ] [Real]Absence check using state equation in 34123 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3785, 1032, 3785, 1032, 1032]
Support contains 10000 out of 20001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20001/20001 places, 20001/20001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 20001 transition count 20000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20000 transition count 20000
Applied a total of 2 rules in 3590 ms. Remains 20000 /20001 variables (removed 1) and now considering 20000/20001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20001 places, 20000/20001 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 07:59:51] [INFO ] Computed 10000 place invariants in 47 ms
Finished random walk after 14883 steps, including 0 resets, run visited all 5 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5064 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5150 ms. (steps per millisecond=4 )
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5003 ms. (steps per millisecond=4 )
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:00:47] [INFO ] Computed 10000 place invariants in 43 ms
[2023-03-15 08:01:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 19470 ms returned sat
[2023-03-15 08:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:01:32] [INFO ] [Real]Absence check using state equation in 23471 ms returned unknown
[2023-03-15 08:01:43] [INFO ] [Real]Absence check using 10000 positive place invariants in 9217 ms returned sat
[2023-03-15 08:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:02:17] [INFO ] [Real]Absence check using state equation in 33749 ms returned unknown
[2023-03-15 08:02:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 21438 ms returned sat
[2023-03-15 08:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:03:02] [INFO ] [Real]Absence check using state equation in 21504 ms returned unknown
[2023-03-15 08:03:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 8446 ms returned sat
[2023-03-15 08:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:03:47] [INFO ] [Real]Absence check using state equation in 34450 ms returned unknown
[2023-03-15 08:03:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 8582 ms returned sat
[2023-03-15 08:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:04:32] [INFO ] [Real]Absence check using state equation in 34183 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3834, 1051, 3834, 1051, 1051]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1814 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1718 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:04:36] [INFO ] Computed 10000 place invariants in 45 ms
[2023-03-15 08:04:37] [INFO ] Implicit Places using invariants in 1821 ms returned []
Implicit Place search using SMT only with invariants took 1830 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:04:37] [INFO ] Computed 10000 place invariants in 41 ms
[2023-03-15 08:04:39] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:04:39] [INFO ] Computed 10000 place invariants in 41 ms
Finished random walk after 15046 steps, including 0 resets, run visited all 5 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5038 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5158 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5180 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 20999 steps, including 0 resets, run timeout after 5179 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 21999 steps, including 0 resets, run timeout after 5214 ms. (steps per millisecond=4 ) properties seen 6
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:05:35] [INFO ] Computed 10000 place invariants in 47 ms
[2023-03-15 08:05:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 19529 ms returned sat
[2023-03-15 08:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:06:20] [INFO ] [Real]Absence check using state equation in 23292 ms returned unknown
[2023-03-15 08:06:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 10074 ms returned sat
[2023-03-15 08:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:07:05] [INFO ] [Real]Absence check using state equation in 32823 ms returned unknown
[2023-03-15 08:07:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 20110 ms returned sat
[2023-03-15 08:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:07:50] [INFO ] [Real]Absence check using state equation in 22817 ms returned unknown
[2023-03-15 08:08:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 9197 ms returned sat
[2023-03-15 08:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:08:35] [INFO ] [Real]Absence check using state equation in 33790 ms returned unknown
[2023-03-15 08:08:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 9265 ms returned sat
[2023-03-15 08:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:09:20] [INFO ] [Real]Absence check using state equation in 33732 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3863, 1051, 3863, 1051, 1051]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1717 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1659 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:09:24] [INFO ] Computed 10000 place invariants in 38 ms
[2023-03-15 08:09:25] [INFO ] Implicit Places using invariants in 1624 ms returned []
Implicit Place search using SMT only with invariants took 1630 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:09:25] [INFO ] Computed 10000 place invariants in 39 ms
[2023-03-15 08:09:27] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:09:27] [INFO ] Computed 10000 place invariants in 38 ms
Finished random walk after 15253 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5232 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 21999 steps, including 0 resets, run visited all 5 properties in 5203 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5217 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 21999 steps, including 0 resets, run timeout after 5206 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5022 ms. (steps per millisecond=4 )
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:10:23] [INFO ] Computed 10000 place invariants in 39 ms
[2023-03-15 08:10:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 20746 ms returned sat
[2023-03-15 08:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:11:08] [INFO ] [Real]Absence check using state equation in 22082 ms returned unknown
[2023-03-15 08:11:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 9193 ms returned sat
[2023-03-15 08:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:11:53] [INFO ] [Real]Absence check using state equation in 33742 ms returned unknown
[2023-03-15 08:12:15] [INFO ] [Real]Absence check using 10000 positive place invariants in 19107 ms returned sat
[2023-03-15 08:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:12:38] [INFO ] [Real]Absence check using state equation in 23783 ms returned unknown
[2023-03-15 08:12:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 9356 ms returned sat
[2023-03-15 08:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:13:23] [INFO ] [Real]Absence check using state equation in 33567 ms returned unknown
[2023-03-15 08:13:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 8617 ms returned sat
[2023-03-15 08:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:14:08] [INFO ] [Real]Absence check using state equation in 34121 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3941, 1051, 3941, 1051, 1051]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1719 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1834 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:14:12] [INFO ] Computed 10000 place invariants in 52 ms
[2023-03-15 08:14:14] [INFO ] Implicit Places using invariants in 1831 ms returned []
Implicit Place search using SMT only with invariants took 1835 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:14:14] [INFO ] Computed 10000 place invariants in 44 ms
[2023-03-15 08:14:16] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:14:16] [INFO ] Computed 10000 place invariants in 47 ms
Finished random walk after 14920 steps, including 0 resets, run visited all 5 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 20999 steps, including 0 resets, run visited all 5 properties in 5023 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5227 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 21999 steps, including 0 resets, run timeout after 5228 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 21999 steps, including 0 resets, run timeout after 5151 ms. (steps per millisecond=4 ) properties seen 6
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:15:11] [INFO ] Computed 10000 place invariants in 34 ms
[2023-03-15 08:15:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 17916 ms returned sat
[2023-03-15 08:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:15:57] [INFO ] [Real]Absence check using state equation in 24873 ms returned unknown
[2023-03-15 08:16:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 10573 ms returned sat
[2023-03-15 08:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:16:42] [INFO ] [Real]Absence check using state equation in 32390 ms returned unknown
[2023-03-15 08:17:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 20743 ms returned sat
[2023-03-15 08:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:17:27] [INFO ] [Real]Absence check using state equation in 22269 ms returned unknown
[2023-03-15 08:17:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 9818 ms returned sat
[2023-03-15 08:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:18:12] [INFO ] [Real]Absence check using state equation in 33118 ms returned unknown
[2023-03-15 08:18:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 9262 ms returned sat
[2023-03-15 08:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:18:57] [INFO ] [Real]Absence check using state equation in 33680 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3941, 1051, 3941, 1051, 1051]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1892 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1798 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:19:01] [INFO ] Computed 10000 place invariants in 48 ms
[2023-03-15 08:19:02] [INFO ] Implicit Places using invariants in 1760 ms returned []
Implicit Place search using SMT only with invariants took 1773 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:19:02] [INFO ] Computed 10000 place invariants in 70 ms
[2023-03-15 08:19:04] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-00
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:19:04] [INFO ] Computed 10000 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16426 ms. (steps per millisecond=0 ) properties (out of 1) seen :1310
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2703 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:19:23] [INFO ] Computed 10000 place invariants in 62 ms
[2023-03-15 08:19:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 2678 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1310]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 4 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 15000 transition count 15000
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6182 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:19:35] [INFO ] Computed 10000 place invariants in 30 ms
Finished random walk after 29367 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
FORMULA Philosophers-PT-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-00 in 60563 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-01
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:20:05] [INFO ] Computed 10000 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16514 ms. (steps per millisecond=0 ) properties (out of 1) seen :988
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2817 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:20:24] [INFO ] Computed 10000 place invariants in 41 ms
[2023-03-15 08:20:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 2683 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[988]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 7110 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:20:36] [INFO ] Computed 10000 place invariants in 29 ms
Finished random walk after 31078 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5217 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:21:12] [INFO ] Computed 10000 place invariants in 38 ms
[2023-03-15 08:21:25] [INFO ] [Real]Absence check using 10000 positive place invariants in 11297 ms returned sat
[2023-03-15 08:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:21:51] [INFO ] [Real]Absence check using state equation in 26864 ms returned sat
[2023-03-15 08:21:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:22:04] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10123 ms returned sat
[2023-03-15 08:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:22:37] [INFO ] [Nat]Absence check using state equation in 33552 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1444]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1333 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1080 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:22:40] [INFO ] Computed 10000 place invariants in 25 ms
[2023-03-15 08:22:41] [INFO ] Implicit Places using invariants in 1353 ms returned []
Implicit Place search using SMT only with invariants took 1354 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:22:41] [INFO ] Computed 10000 place invariants in 27 ms
[2023-03-15 08:22:42] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:22:42] [INFO ] Computed 10000 place invariants in 27 ms
Finished random walk after 31400 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5106 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:23:18] [INFO ] Computed 10000 place invariants in 30 ms
[2023-03-15 08:23:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 10258 ms returned sat
[2023-03-15 08:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:23:58] [INFO ] [Real]Absence check using state equation in 28898 ms returned sat
[2023-03-15 08:23:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:24:11] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10665 ms returned sat
[2023-03-15 08:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:24:44] [INFO ] [Nat]Absence check using state equation in 32748 ms returned sat
[2023-03-15 08:25:58] [INFO ] Deduced a trap composed of 2 places in 74262 ms of which 29 ms to minimize.
[2023-03-15 08:25:58] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1444]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1074 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1151 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:26:01] [INFO ] Computed 10000 place invariants in 25 ms
[2023-03-15 08:26:02] [INFO ] Implicit Places using invariants in 1436 ms returned []
Implicit Place search using SMT only with invariants took 1437 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:26:02] [INFO ] Computed 10000 place invariants in 20 ms
[2023-03-15 08:26:03] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-01 in 358690 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-02
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:26:03] [INFO ] Computed 10000 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16396 ms. (steps per millisecond=0 ) properties (out of 1) seen :1341
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2496 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:26:22] [INFO ] Computed 10000 place invariants in 43 ms
[2023-03-15 08:26:27] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1341]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 6 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 15000 transition count 15000
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6530 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:26:34] [INFO ] Computed 10000 place invariants in 16 ms
Finished random walk after 29662 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
FORMULA Philosophers-PT-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-02 in 60607 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-04
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:27:04] [INFO ] Computed 10000 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16403 ms. (steps per millisecond=0 ) properties (out of 1) seen :981
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2401 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-15 08:27:23] [INFO ] Computed 10000 place invariants in 43 ms
[2023-03-15 08:27:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 2798 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[981]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6437 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:27:34] [INFO ] Computed 10000 place invariants in 21 ms
Finished random walk after 31396 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5197 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:28:10] [INFO ] Computed 10000 place invariants in 27 ms
[2023-03-15 08:28:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 9891 ms returned sat
[2023-03-15 08:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:28:46] [INFO ] [Real]Absence check using state equation in 24901 ms returned sat
[2023-03-15 08:28:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:28:58] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10246 ms returned sat
[2023-03-15 08:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:29:29] [INFO ] [Nat]Absence check using state equation in 31117 ms returned sat
[2023-03-15 08:29:31] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 460 ms.
[2023-03-15 08:29:32] [INFO ] Added : 0 causal constraints over 0 iterations in 1794 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1439]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1140 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1118 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:30:04] [INFO ] Computed 10000 place invariants in 26 ms
[2023-03-15 08:30:06] [INFO ] Implicit Places using invariants in 1378 ms returned []
Implicit Place search using SMT only with invariants took 1379 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:30:06] [INFO ] Computed 10000 place invariants in 37 ms
[2023-03-15 08:30:07] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:30:07] [INFO ] Computed 10000 place invariants in 16 ms
Finished random walk after 31540 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5185 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:30:42] [INFO ] Computed 10000 place invariants in 21 ms
[2023-03-15 08:30:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 10186 ms returned sat
[2023-03-15 08:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:31:19] [INFO ] [Real]Absence check using state equation in 25137 ms returned sat
[2023-03-15 08:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:31:32] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10010 ms returned sat
[2023-03-15 08:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:32:05] [INFO ] [Nat]Absence check using state equation in 32389 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1442]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1123 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1077 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:32:07] [INFO ] Computed 10000 place invariants in 31 ms
[2023-03-15 08:32:08] [INFO ] Implicit Places using invariants in 1276 ms returned []
Implicit Place search using SMT only with invariants took 1277 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:32:08] [INFO ] Computed 10000 place invariants in 35 ms
[2023-03-15 08:32:09] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:32:09] [INFO ] Computed 10000 place invariants in 34 ms
Finished random walk after 32028 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5011 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:32:44] [INFO ] Computed 10000 place invariants in 28 ms
[2023-03-15 08:32:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 9510 ms returned sat
[2023-03-15 08:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:33:17] [INFO ] [Real]Absence check using state equation in 21834 ms returned sat
[2023-03-15 08:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:33:30] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10433 ms returned sat
[2023-03-15 08:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:34:00] [INFO ] [Nat]Absence check using state equation in 30735 ms returned sat
[2023-03-15 08:34:02] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 459 ms.
[2023-03-15 08:34:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1727 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1456]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1118 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1120 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:34:35] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:34:37] [INFO ] Implicit Places using invariants in 1379 ms returned []
Implicit Place search using SMT only with invariants took 1390 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:34:37] [INFO ] Computed 10000 place invariants in 19 ms
[2023-03-15 08:34:38] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:34:38] [INFO ] Computed 10000 place invariants in 16 ms
Finished random walk after 31383 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5011 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:35:13] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:35:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9378 ms returned sat
[2023-03-15 08:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:35:48] [INFO ] [Real]Absence check using state equation in 24317 ms returned sat
[2023-03-15 08:35:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:36:00] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9949 ms returned sat
[2023-03-15 08:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:36:29] [INFO ] [Nat]Absence check using state equation in 29092 ms returned sat
[2023-03-15 08:36:30] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 455 ms.
[2023-03-15 08:36:32] [INFO ] Added : 0 causal constraints over 0 iterations in 1809 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1457]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1093 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1138 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:37:04] [INFO ] Computed 10000 place invariants in 18 ms
[2023-03-15 08:37:06] [INFO ] Implicit Places using invariants in 2026 ms returned []
Implicit Place search using SMT only with invariants took 2037 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:37:06] [INFO ] Computed 10000 place invariants in 30 ms
[2023-03-15 08:37:08] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:37:08] [INFO ] Computed 10000 place invariants in 20 ms
Finished random walk after 31183 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5146 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:37:43] [INFO ] Computed 10000 place invariants in 31 ms
[2023-03-15 08:37:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 10399 ms returned sat
[2023-03-15 08:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:38:25] [INFO ] [Real]Absence check using state equation in 30247 ms returned sat
[2023-03-15 08:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:38:37] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10425 ms returned sat
[2023-03-15 08:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:39:05] [INFO ] [Nat]Absence check using state equation in 27289 ms returned sat
[2023-03-15 08:39:06] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 424 ms.
[2023-03-15 08:39:07] [INFO ] Added : 0 causal constraints over 0 iterations in 1718 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1458]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1104 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1134 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:39:40] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:39:43] [INFO ] Implicit Places using invariants in 2457 ms returned []
Implicit Place search using SMT only with invariants took 2476 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:39:43] [INFO ] Computed 10000 place invariants in 33 ms
[2023-03-15 08:39:45] [INFO ] Dead Transitions using invariants and state equation in 2749 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:39:46] [INFO ] Computed 10000 place invariants in 29 ms
Finished random walk after 30941 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5111 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:40:21] [INFO ] Computed 10000 place invariants in 27 ms
[2023-03-15 08:40:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 9904 ms returned sat
[2023-03-15 08:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:40:57] [INFO ] [Real]Absence check using state equation in 25250 ms returned sat
[2023-03-15 08:40:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:41:09] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9768 ms returned sat
[2023-03-15 08:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:41:38] [INFO ] [Nat]Absence check using state equation in 28632 ms returned sat
[2023-03-15 08:41:39] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 466 ms.
[2023-03-15 08:41:40] [INFO ] Added : 0 causal constraints over 0 iterations in 1711 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1459]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1199 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1147 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:42:13] [INFO ] Computed 10000 place invariants in 34 ms
[2023-03-15 08:42:14] [INFO ] Implicit Places using invariants in 1228 ms returned []
Implicit Place search using SMT only with invariants took 1229 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:42:14] [INFO ] Computed 10000 place invariants in 29 ms
[2023-03-15 08:42:15] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:42:16] [INFO ] Computed 10000 place invariants in 33 ms
Finished random walk after 31691 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5239 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:42:51] [INFO ] Computed 10000 place invariants in 34 ms
[2023-03-15 08:43:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 9962 ms returned sat
[2023-03-15 08:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:43:23] [INFO ] [Real]Absence check using state equation in 20822 ms returned sat
[2023-03-15 08:43:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:43:34] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9343 ms returned sat
[2023-03-15 08:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:44:00] [INFO ] [Nat]Absence check using state equation in 26006 ms returned sat
[2023-03-15 08:44:01] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 396 ms.
[2023-03-15 08:44:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1737 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1460]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1096 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1056 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:44:36] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:44:37] [INFO ] Implicit Places using invariants in 1241 ms returned []
Implicit Place search using SMT only with invariants took 1247 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:44:37] [INFO ] Computed 10000 place invariants in 24 ms
[2023-03-15 08:44:38] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:44:38] [INFO ] Computed 10000 place invariants in 21 ms
Finished random walk after 31256 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5087 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:45:13] [INFO ] Computed 10000 place invariants in 25 ms
[2023-03-15 08:45:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9406 ms returned sat
[2023-03-15 08:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:45:49] [INFO ] [Real]Absence check using state equation in 24978 ms returned sat
[2023-03-15 08:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:46:00] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9584 ms returned sat
[2023-03-15 08:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:46:24] [INFO ] [Nat]Absence check using state equation in 23478 ms returned sat
[2023-03-15 08:46:25] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 370 ms.
[2023-03-15 08:46:26] [INFO ] Added : 0 causal constraints over 0 iterations in 1648 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1461]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1084 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1056 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:46:59] [INFO ] Computed 10000 place invariants in 19 ms
[2023-03-15 08:47:00] [INFO ] Implicit Places using invariants in 1258 ms returned []
Implicit Place search using SMT only with invariants took 1264 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:47:00] [INFO ] Computed 10000 place invariants in 21 ms
[2023-03-15 08:47:02] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:47:02] [INFO ] Computed 10000 place invariants in 20 ms
Finished random walk after 31479 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5182 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:47:37] [INFO ] Computed 10000 place invariants in 21 ms
[2023-03-15 08:47:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 9349 ms returned sat
[2023-03-15 08:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:48:10] [INFO ] [Real]Absence check using state equation in 22582 ms returned sat
[2023-03-15 08:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:48:22] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9667 ms returned sat
[2023-03-15 08:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:48:45] [INFO ] [Nat]Absence check using state equation in 23334 ms returned sat
[2023-03-15 08:48:46] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 394 ms.
[2023-03-15 08:48:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1598 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1462]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1080 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1055 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:49:20] [INFO ] Computed 10000 place invariants in 25 ms
[2023-03-15 08:49:21] [INFO ] Implicit Places using invariants in 1298 ms returned []
Implicit Place search using SMT only with invariants took 1300 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:49:21] [INFO ] Computed 10000 place invariants in 20 ms
[2023-03-15 08:49:23] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:49:23] [INFO ] Computed 10000 place invariants in 22 ms
Finished random walk after 31622 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5230 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:49:58] [INFO ] Computed 10000 place invariants in 24 ms
[2023-03-15 08:50:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 9362 ms returned sat
[2023-03-15 08:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:50:29] [INFO ] [Real]Absence check using state equation in 20607 ms returned sat
[2023-03-15 08:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:50:40] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9158 ms returned sat
[2023-03-15 08:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:51:05] [INFO ] [Nat]Absence check using state equation in 24842 ms returned sat
[2023-03-15 08:51:06] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 433 ms.
[2023-03-15 08:51:08] [INFO ] Added : 0 causal constraints over 0 iterations in 1684 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1463]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1145 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1109 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:51:41] [INFO ] Computed 10000 place invariants in 29 ms
[2023-03-15 08:51:42] [INFO ] Implicit Places using invariants in 1397 ms returned []
Implicit Place search using SMT only with invariants took 1398 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:51:42] [INFO ] Computed 10000 place invariants in 26 ms
[2023-03-15 08:51:43] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:51:43] [INFO ] Computed 10000 place invariants in 20 ms
Finished random walk after 30900 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5185 ms. (steps per millisecond=4 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:52:19] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:52:30] [INFO ] [Real]Absence check using 10000 positive place invariants in 9770 ms returned sat
[2023-03-15 08:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:52:57] [INFO ] [Real]Absence check using state equation in 26660 ms returned sat
[2023-03-15 08:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:53:10] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11334 ms returned sat
[2023-03-15 08:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is Philosophers-PT-005000, 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 r319-tall-167873969900033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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