fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945200261
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Philosophers-PT-005000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7826.247 3600000.00 3748019.00 22179.80 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.r293-tall-167873945200261.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 itstools
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 r293-tall-167873945200261
=====================================================================

--------------------
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 1678814936014

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-005000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-14 17:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 17:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:28:58] [INFO ] Load time of PNML (sax parser for PT used): 579 ms
[2023-03-14 17:28:58] [INFO ] Transformed 25000 places.
[2023-03-14 17:28:58] [INFO ] Transformed 25000 transitions.
[2023-03-14 17:28:58] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 771 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4099 ms.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-14 17:29:03] [INFO ] Computed 10000 place invariants in 192 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 24422 ms. (steps per millisecond=0 ) properties (out of 10) seen :3560
FORMULA Philosophers-PT-005000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 3311 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3163 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3135 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3217 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3149 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
[2023-03-14 17:29:43] [INFO ] Invariant cache hit.
[2023-03-14 17:29:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 1797 ms returned unknown
[2023-03-14 17:29:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 2045 ms returned unknown
[2023-03-14 17:29: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: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:886)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 17:30:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 2064 ms returned unknown
[2023-03-14 17:30:08] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:886)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[1092, 457, 1092, 457, 457]
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 25000 transition count 20000
Reduce places removed 5000 places and 0 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 9551 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9554 ms. Remains : 20000/25000 places, 20000/25000 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-14 17:30:18] [INFO ] Computed 10000 place invariants in 91 ms
Finished random walk after 16229 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5250 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5228 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5212 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-14 17:31:14] [INFO ] Invariant cache hit.
[2023-03-14 17:31:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 19749 ms returned sat
[2023-03-14 17:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:31:59] [INFO ] [Real]Absence check using state equation in 23223 ms returned unknown
[2023-03-14 17:32:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 8650 ms returned sat
[2023-03-14 17:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:32:44] [INFO ] [Real]Absence check using state equation in 34178 ms returned unknown
[2023-03-14 17:33:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 19620 ms returned sat
[2023-03-14 17:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:33:29] [INFO ] [Real]Absence check using state equation in 23400 ms returned unknown
[2023-03-14 17:33:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 8723 ms returned sat
[2023-03-14 17:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:34:14] [INFO ] [Real]Absence check using state equation in 34179 ms returned unknown
[2023-03-14 17:34:25] [INFO ] [Real]Absence check using 10000 positive place invariants in 8589 ms returned sat
[2023-03-14 17:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:34:59] [INFO ] [Real]Absence check using state equation in 34320 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4035, 1013, 4035, 1013, 1013]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1927 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1927 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1813 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 17:35:03] [INFO ] Invariant cache hit.
[2023-03-14 17:35:05] [INFO ] Implicit Places using invariants in 1610 ms returned []
Implicit Place search using SMT only with invariants took 1611 ms to find 0 implicit places.
[2023-03-14 17:35:05] [INFO ] Invariant cache hit.
[2023-03-14 17:35:06] [INFO ] Dead Transitions using invariants and state equation in 1603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5039 ms. Remains : 20000/20000 places, 20000/20000 transitions.
[2023-03-14 17:35:06] [INFO ] Invariant cache hit.
Finished random walk after 16021 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5140 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5264 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5244 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5244 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5087 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-14 17:36:02] [INFO ] Invariant cache hit.
[2023-03-14 17:36:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 19984 ms returned sat
[2023-03-14 17:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:36:47] [INFO ] [Real]Absence check using state equation in 23052 ms returned unknown
[2023-03-14 17:36:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 8774 ms returned sat
[2023-03-14 17:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:37:32] [INFO ] [Real]Absence check using state equation in 33908 ms returned unknown
[2023-03-14 17:37:56] [INFO ] [Real]Absence check using 10000 positive place invariants in 21033 ms returned sat
[2023-03-14 17:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:38:18] [INFO ] [Real]Absence check using state equation in 21882 ms returned unknown
[2023-03-14 17:38:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 8887 ms returned sat
[2023-03-14 17:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:39:03] [INFO ] [Real]Absence check using state equation in 33991 ms returned unknown
[2023-03-14 17:39:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 9199 ms returned sat
[2023-03-14 17:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:39:48] [INFO ] [Real]Absence check using state equation in 33731 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4067, 1013, 4067, 1013, 1013]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1680 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1680 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1595 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 17:39:51] [INFO ] Invariant cache hit.
[2023-03-14 17:39:53] [INFO ] Implicit Places using invariants in 1666 ms returned []
Implicit Place search using SMT only with invariants took 1668 ms to find 0 implicit places.
[2023-03-14 17:39:53] [INFO ] Invariant cache hit.
[2023-03-14 17:39:54] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4844 ms. Remains : 20000/20000 places, 20000/20000 transitions.
[2023-03-14 17:39:54] [INFO ] Invariant cache hit.
Finished random walk after 15742 steps, including 0 resets, run visited all 5 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5225 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5098 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5137 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5073 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5140 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-14 17:40:50] [INFO ] Invariant cache hit.
[2023-03-14 17:41:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 20263 ms returned sat
[2023-03-14 17:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:41:35] [INFO ] [Real]Absence check using state equation in 22703 ms returned unknown
[2023-03-14 17:41:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 8488 ms returned sat
[2023-03-14 17:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:42:20] [INFO ] [Real]Absence check using state equation in 34055 ms returned unknown
[2023-03-14 17:42:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 22058 ms returned sat
[2023-03-14 17:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:43:05] [INFO ] [Real]Absence check using state equation in 20794 ms returned unknown
[2023-03-14 17:43:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9099 ms returned sat
[2023-03-14 17:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:43:50] [INFO ] [Real]Absence check using state equation in 33569 ms returned unknown
[2023-03-14 17:44:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 12346 ms returned sat
[2023-03-14 17:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:44:35] [INFO ] [Real]Absence check using state equation in 30354 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4067, 1019, 4067, 1019, 1019]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1718 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1703 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 17:44:39] [INFO ] Invariant cache hit.
[2023-03-14 17:44:41] [INFO ] Implicit Places using invariants in 1761 ms returned []
Implicit Place search using SMT only with invariants took 1763 ms to find 0 implicit places.
[2023-03-14 17:44:41] [INFO ] Invariant cache hit.
[2023-03-14 17:44:42] [INFO ] Dead Transitions using invariants and state equation in 1763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5234 ms. Remains : 20000/20000 places, 20000/20000 transitions.
[2023-03-14 17:44:42] [INFO ] Invariant cache hit.
Finished random walk after 15475 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5168 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5230 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5111 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5168 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5306 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-14 17:45:38] [INFO ] Invariant cache hit.
[2023-03-14 17:46:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 20214 ms returned sat
[2023-03-14 17:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:46:24] [INFO ] [Real]Absence check using state equation in 22512 ms returned unknown
[2023-03-14 17:46:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 9894 ms returned sat
[2023-03-14 17:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:47:09] [INFO ] [Real]Absence check using state equation in 33004 ms returned unknown
[2023-03-14 17:47:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 21220 ms returned sat
[2023-03-14 17:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:47:54] [INFO ] [Real]Absence check using state equation in 21799 ms returned unknown
[2023-03-14 17:48:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 9240 ms returned sat
[2023-03-14 17:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:48:39] [INFO ] [Real]Absence check using state equation in 33655 ms returned unknown
[2023-03-14 17:48:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 8808 ms returned sat
[2023-03-14 17:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:49:24] [INFO ] [Real]Absence check using state equation in 34142 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4067, 1019, 4067, 1019, 1019]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1673 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1673 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1586 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 17:49:27] [INFO ] Invariant cache hit.
[2023-03-14 17:49:29] [INFO ] Implicit Places using invariants in 1587 ms returned []
Implicit Place search using SMT only with invariants took 1610 ms to find 0 implicit places.
[2023-03-14 17:49:29] [INFO ] Invariant cache hit.
[2023-03-14 17:49:30] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4759 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-00
[2023-03-14 17:49:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16628 ms. (steps per millisecond=0 ) properties (out of 1) seen :1387
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3220 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-14 17:49:50] [INFO ] Invariant cache hit.
[2023-03-14 17:49:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 2911 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1387]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 3 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 6873 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6886 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-14 17:50:02] [INFO ] Computed 10000 place invariants in 36 ms
Finished random walk after 29918 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 61895 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-01
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-14 17:50:32] [INFO ] Computed 10000 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16576 ms. (steps per millisecond=0 ) properties (out of 1) seen :1025
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3136 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-14 17:50:52] [INFO ] Invariant cache hit.
[2023-03-14 17:50:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 2885 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1025]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 6888 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6888 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-14 17:51:04] [INFO ] Computed 10000 place invariants in 28 ms
Finished random walk after 31829 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5239 ms. (steps per millisecond=3 )
[2023-03-14 17:51:39] [INFO ] Invariant cache hit.
[2023-03-14 17:51:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 9220 ms returned sat
[2023-03-14 17:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:52:13] [INFO ] [Real]Absence check using state equation in 23163 ms returned sat
[2023-03-14 17:52:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:52:24] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9039 ms returned sat
[2023-03-14 17:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:52:46] [INFO ] [Nat]Absence check using state equation in 22476 ms returned sat
[2023-03-14 17:52:48] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 446 ms.
[2023-03-14 17:52:49] [INFO ] Added : 0 causal constraints over 0 iterations in 1737 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1436]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1043 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1045 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1026 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 17:53:22] [INFO ] Invariant cache hit.
[2023-03-14 17:53:23] [INFO ] Implicit Places using invariants in 1237 ms returned []
Implicit Place search using SMT only with invariants took 1248 ms to find 0 implicit places.
[2023-03-14 17:53:23] [INFO ] Invariant cache hit.
[2023-03-14 17:53:24] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3497 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 17:53:24] [INFO ] Invariant cache hit.
Finished random walk after 31655 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5038 ms. (steps per millisecond=3 )
[2023-03-14 17:53:59] [INFO ] Invariant cache hit.
[2023-03-14 17:54:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 9887 ms returned sat
[2023-03-14 17:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:54:34] [INFO ] [Real]Absence check using state equation in 22892 ms returned sat
[2023-03-14 17:54:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:54:45] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9159 ms returned sat
[2023-03-14 17:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:55:08] [INFO ] [Nat]Absence check using state equation in 23368 ms returned sat
[2023-03-14 17:55:09] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 444 ms.
[2023-03-14 17:55:11] [INFO ] Added : 0 causal constraints over 0 iterations in 1711 ms. Result :sat
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 REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1064 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-14 17:55:43] [INFO ] Invariant cache hit.
[2023-03-14 17:55:45] [INFO ] Implicit Places using invariants in 1220 ms returned []
Implicit Place search using SMT only with invariants took 1223 ms to find 0 implicit places.
[2023-03-14 17:55:45] [INFO ] Invariant cache hit.
[2023-03-14 17:55:46] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3665 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 17:55:46] [INFO ] Invariant cache hit.
Finished random walk after 31824 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5214 ms. (steps per millisecond=3 )
[2023-03-14 17:56:21] [INFO ] Invariant cache hit.
[2023-03-14 17:56:33] [INFO ] [Real]Absence check using 10000 positive place invariants in 10114 ms returned sat
[2023-03-14 17:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:56:59] [INFO ] [Real]Absence check using state equation in 26697 ms returned sat
[2023-03-14 17:57:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:57:13] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11150 ms returned sat
[2023-03-14 17:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:57:36] [INFO ] [Nat]Absence check using state equation in 23296 ms returned sat
[2023-03-14 17:57:37] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 362 ms.
[2023-03-14 17:57:38] [INFO ] Added : 0 causal constraints over 0 iterations in 1592 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1443]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1047 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1043 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 17:58:11] [INFO ] Invariant cache hit.
[2023-03-14 17:58:12] [INFO ] Implicit Places using invariants in 1211 ms returned []
Implicit Place search using SMT only with invariants took 1212 ms to find 0 implicit places.
[2023-03-14 17:58:12] [INFO ] Invariant cache hit.
[2023-03-14 17:58:13] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3424 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 17:58:13] [INFO ] Invariant cache hit.
Finished random walk after 32187 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5176 ms. (steps per millisecond=3 )
[2023-03-14 17:58:48] [INFO ] Invariant cache hit.
[2023-03-14 17:58:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 9237 ms returned sat
[2023-03-14 17:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 17:59:23] [INFO ] [Real]Absence check using state equation in 24299 ms returned sat
[2023-03-14 17:59:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 17:59:35] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9287 ms returned sat
[2023-03-14 17:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 17:59:56] [INFO ] [Nat]Absence check using state equation in 21526 ms returned sat
[2023-03-14 17:59:57] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 385 ms.
[2023-03-14 17:59:58] [INFO ] Added : 0 causal constraints over 0 iterations in 1584 ms. Result :sat
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 REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1030 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1025 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:00:31] [INFO ] Invariant cache hit.
[2023-03-14 18:00:32] [INFO ] Implicit Places using invariants in 1176 ms returned []
Implicit Place search using SMT only with invariants took 1201 ms to find 0 implicit places.
[2023-03-14 18:00:32] [INFO ] Invariant cache hit.
[2023-03-14 18:00:33] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3413 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:00:33] [INFO ] Invariant cache hit.
Finished random walk after 31963 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5203 ms. (steps per millisecond=3 )
[2023-03-14 18:01:09] [INFO ] Invariant cache hit.
[2023-03-14 18:01:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 9547 ms returned sat
[2023-03-14 18:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:01:42] [INFO ] [Real]Absence check using state equation in 22504 ms returned sat
[2023-03-14 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:01:54] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9710 ms returned sat
[2023-03-14 18:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:02:17] [INFO ] [Nat]Absence check using state equation in 22806 ms returned sat
[2023-03-14 18:02:18] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 416 ms.
[2023-03-14 18:02:19] [INFO ] Added : 0 causal constraints over 0 iterations in 1765 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1445]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1032 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:02:52] [INFO ] Invariant cache hit.
[2023-03-14 18:02:53] [INFO ] Implicit Places using invariants in 1194 ms returned []
Implicit Place search using SMT only with invariants took 1196 ms to find 0 implicit places.
[2023-03-14 18:02:53] [INFO ] Invariant cache hit.
[2023-03-14 18:02:54] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3420 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:02:54] [INFO ] Invariant cache hit.
Finished random walk after 31708 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5294 ms. (steps per millisecond=3 )
[2023-03-14 18:03:30] [INFO ] Invariant cache hit.
[2023-03-14 18:03:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 9757 ms returned sat
[2023-03-14 18:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:04:04] [INFO ] [Real]Absence check using state equation in 22624 ms returned sat
[2023-03-14 18:04:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:04:16] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10005 ms returned sat
[2023-03-14 18:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:04:39] [INFO ] [Nat]Absence check using state equation in 23440 ms returned sat
[2023-03-14 18:04:40] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 413 ms.
[2023-03-14 18:04:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1751 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1446]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1060 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1061 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1038 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:05:14] [INFO ] Invariant cache hit.
[2023-03-14 18:05:16] [INFO ] Implicit Places using invariants in 1463 ms returned []
Implicit Place search using SMT only with invariants took 1466 ms to find 0 implicit places.
[2023-03-14 18:05:16] [INFO ] Invariant cache hit.
[2023-03-14 18:05:17] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3757 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:05:17] [INFO ] Invariant cache hit.
Finished random walk after 31880 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5278 ms. (steps per millisecond=3 )
[2023-03-14 18:05:52] [INFO ] Invariant cache hit.
[2023-03-14 18:06:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 9591 ms returned sat
[2023-03-14 18:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:06:24] [INFO ] [Real]Absence check using state equation in 20412 ms returned sat
[2023-03-14 18:06:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:06:36] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10119 ms returned sat
[2023-03-14 18:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:06:59] [INFO ] [Nat]Absence check using state equation in 23129 ms returned sat
[2023-03-14 18:07:00] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 423 ms.
[2023-03-14 18:07:01] [INFO ] Added : 0 causal constraints over 0 iterations in 1718 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1447]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1050 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1051 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1052 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:07:34] [INFO ] Invariant cache hit.
[2023-03-14 18:07:36] [INFO ] Implicit Places using invariants in 1496 ms returned []
Implicit Place search using SMT only with invariants took 1497 ms to find 0 implicit places.
[2023-03-14 18:07:36] [INFO ] Invariant cache hit.
[2023-03-14 18:07:37] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3844 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:07:37] [INFO ] Invariant cache hit.
Finished random walk after 31821 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5039 ms. (steps per millisecond=3 )
[2023-03-14 18:08:12] [INFO ] Invariant cache hit.
[2023-03-14 18:08:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 9715 ms returned sat
[2023-03-14 18:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:08:52] [INFO ] [Real]Absence check using state equation in 28955 ms returned sat
[2023-03-14 18:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:09:04] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10240 ms returned sat
[2023-03-14 18:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:09:34] [INFO ] [Nat]Absence check using state equation in 30223 ms returned sat
[2023-03-14 18:09:36] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 373 ms.
[2023-03-14 18:09:37] [INFO ] Added : 0 causal constraints over 0 iterations in 1707 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1448]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1111 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1112 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-14 18:10:10] [INFO ] Invariant cache hit.
[2023-03-14 18:10:11] [INFO ] Implicit Places using invariants in 1213 ms returned []
Implicit Place search using SMT only with invariants took 1213 ms to find 0 implicit places.
[2023-03-14 18:10:11] [INFO ] Invariant cache hit.
[2023-03-14 18:10:12] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3549 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:10:12] [INFO ] Invariant cache hit.
Finished random walk after 31904 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5090 ms. (steps per millisecond=3 )
[2023-03-14 18:10:47] [INFO ] Invariant cache hit.
[2023-03-14 18:10:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 9680 ms returned sat
[2023-03-14 18:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:11:26] [INFO ] [Real]Absence check using state equation in 27569 ms returned sat
[2023-03-14 18:11:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:11:38] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10014 ms returned sat
[2023-03-14 18:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:12:03] [INFO ] [Nat]Absence check using state equation in 25092 ms returned sat
[2023-03-14 18:12:05] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 484 ms.
[2023-03-14 18:12:06] [INFO ] Added : 0 causal constraints over 0 iterations in 1727 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1449]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1039 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1039 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1012 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:12:38] [INFO ] Invariant cache hit.
[2023-03-14 18:12:40] [INFO ] Implicit Places using invariants in 1335 ms returned []
Implicit Place search using SMT only with invariants took 1336 ms to find 0 implicit places.
[2023-03-14 18:12:40] [INFO ] Invariant cache hit.
[2023-03-14 18:12:41] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3528 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:12:41] [INFO ] Invariant cache hit.
Finished random walk after 32085 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5014 ms. (steps per millisecond=3 )
[2023-03-14 18:13:16] [INFO ] Invariant cache hit.
[2023-03-14 18:13:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 10069 ms returned sat
[2023-03-14 18:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:13:53] [INFO ] [Real]Absence check using state equation in 25442 ms returned sat
[2023-03-14 18:13:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:14:05] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10039 ms returned sat
[2023-03-14 18:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:14:33] [INFO ] [Nat]Absence check using state equation in 27831 ms returned sat
[2023-03-14 18:14:34] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 363 ms.
[2023-03-14 18:14:35] [INFO ] Added : 0 causal constraints over 0 iterations in 1598 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1450]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1028 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1030 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1031 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:15:08] [INFO ] Invariant cache hit.
[2023-03-14 18:15:09] [INFO ] Implicit Places using invariants in 1201 ms returned []
Implicit Place search using SMT only with invariants took 1203 ms to find 0 implicit places.
[2023-03-14 18:15:09] [INFO ] Invariant cache hit.
[2023-03-14 18:15:10] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3645 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:15:10] [INFO ] Invariant cache hit.
Finished random walk after 31615 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5328 ms. (steps per millisecond=3 )
[2023-03-14 18:15:46] [INFO ] Invariant cache hit.
[2023-03-14 18:15:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 9559 ms returned sat
[2023-03-14 18:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:16:19] [INFO ] [Real]Absence check using state equation in 21838 ms returned sat
[2023-03-14 18:16:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:16:30] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9585 ms returned sat
[2023-03-14 18:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:16:58] [INFO ] [Nat]Absence check using state equation in 28151 ms returned sat
[2023-03-14 18:16:59] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 448 ms.
[2023-03-14 18:17:01] [INFO ] Added : 0 causal constraints over 0 iterations in 1709 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1451]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1025 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1025 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1024 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:17:33] [INFO ] Invariant cache hit.
[2023-03-14 18:17:34] [INFO ] Implicit Places using invariants in 1202 ms returned []
Implicit Place search using SMT only with invariants took 1219 ms to find 0 implicit places.
[2023-03-14 18:17:34] [INFO ] Invariant cache hit.
[2023-03-14 18:17:36] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3551 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:17:36] [INFO ] Invariant cache hit.
Finished random walk after 31886 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5089 ms. (steps per millisecond=3 )
[2023-03-14 18:18:11] [INFO ] Invariant cache hit.
[2023-03-14 18:18:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 9575 ms returned sat
[2023-03-14 18:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:18:43] [INFO ] [Real]Absence check using state equation in 20997 ms returned sat
[2023-03-14 18:18:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:18:54] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9536 ms returned sat
[2023-03-14 18:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:19:16] [INFO ] [Nat]Absence check using state equation in 21664 ms returned sat
[2023-03-14 18:19:17] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 372 ms.
[2023-03-14 18:19:18] [INFO ] Added : 0 causal constraints over 0 iterations in 1636 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1452]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1013 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1040 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:19:51] [INFO ] Invariant cache hit.
[2023-03-14 18:19:52] [INFO ] Implicit Places using invariants in 1405 ms returned []
Implicit Place search using SMT only with invariants took 1409 ms to find 0 implicit places.
[2023-03-14 18:19:52] [INFO ] Invariant cache hit.
[2023-03-14 18:19:54] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3816 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:19:54] [INFO ] Invariant cache hit.
Finished random walk after 32115 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5082 ms. (steps per millisecond=3 )
[2023-03-14 18:20:29] [INFO ] Invariant cache hit.
[2023-03-14 18:20:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 9803 ms returned sat
[2023-03-14 18:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:21:03] [INFO ] [Real]Absence check using state equation in 23066 ms returned sat
[2023-03-14 18:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:21:15] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9704 ms returned sat
[2023-03-14 18:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:21:40] [INFO ] [Nat]Absence check using state equation in 25601 ms returned sat
[2023-03-14 18:21:42] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 463 ms.
[2023-03-14 18:21:43] [INFO ] Added : 0 causal constraints over 0 iterations in 1781 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1453]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1046 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-14 18:22:16] [INFO ] Invariant cache hit.
[2023-03-14 18:22:17] [INFO ] Implicit Places using invariants in 1183 ms returned []
Implicit Place search using SMT only with invariants took 1187 ms to find 0 implicit places.
[2023-03-14 18:22:17] [INFO ] Invariant cache hit.
[2023-03-14 18:22:18] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3585 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:22:18] [INFO ] Invariant cache hit.
Finished random walk after 32016 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 15998 steps, including 0 resets, run visited all 1 properties in 5113 ms. (steps per millisecond=3 )
[2023-03-14 18:22:53] [INFO ] Invariant cache hit.
[2023-03-14 18:23:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 9574 ms returned sat
[2023-03-14 18:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:23:28] [INFO ] [Real]Absence check using state equation in 23491 ms returned sat
[2023-03-14 18:23:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:23:40] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9719 ms returned sat
[2023-03-14 18:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:24:05] [INFO ] [Nat]Absence check using state equation in 24841 ms returned sat
[2023-03-14 18:24:06] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 461 ms.
[2023-03-14 18:24:07] [INFO ] Added : 0 causal constraints over 0 iterations in 1746 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1454]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1041 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1042 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1030 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:24:40] [INFO ] Invariant cache hit.
[2023-03-14 18:24:41] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1394 ms to find 0 implicit places.
[2023-03-14 18:24:41] [INFO ] Invariant cache hit.
[2023-03-14 18:24:42] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3763 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:24:42] [INFO ] Invariant cache hit.
Finished random walk after 32230 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5258 ms. (steps per millisecond=3 )
[2023-03-14 18:25:18] [INFO ] Invariant cache hit.
[2023-03-14 18:25:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 10053 ms returned sat
[2023-03-14 18:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:25:56] [INFO ] [Real]Absence check using state equation in 27044 ms returned sat
[2023-03-14 18:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:26:08] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9862 ms returned sat
[2023-03-14 18:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:26:31] [INFO ] [Nat]Absence check using state equation in 22977 ms returned sat
[2023-03-14 18:26:32] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 417 ms.
[2023-03-14 18:26:34] [INFO ] Added : 0 causal constraints over 0 iterations in 1685 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1455]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1042 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1042 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1052 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 18:27:06] [INFO ] Invariant cache hit.
[2023-03-14 18:27:08] [INFO ] Implicit Places using invariants in 1425 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2023-03-14 18:27:08] [INFO ] Invariant cache hit.
[2023-03-14 18:27:09] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3667 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 18:27:09] [INFO ] Invariant cache hit.
Finished random walk after 32216 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 16998 steps, including 0 resets, run visited all 1 properties in 5250 ms. (steps per millisecond=3 )
[2023-03-14 18:27:44] [INFO ] Invariant cache hit.
[2023-03-14 18:27:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 9375 ms returned sat
[2023-03-14 18:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:28:19] [INFO ] [Real]Absence check using state equation in 24337 ms returned sat
[2023-03-14 18:28:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 18:28:31] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9751 ms returned sat
[2023-03-14 18:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 18:28:52] [INFO ] [Nat]Absence check using state equation in 21145 ms returned sat
[2023-03-14 18:28:53] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 382 ms.
[2023-03-14 18:28:54] [INFO ] Added : 0 causal constraints over 0 iterations in 1557 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1456]
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13303504 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15854148 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-005000"
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-5348"
echo " Executing tool itstools"
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 r293-tall-167873945200261"
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 ;