MCC'2024- Execution of r285-smll-171654422400286

About the Execution of 2023-gold for Philosophers-COL-010000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
7768.951	3600000.00	4072652.00	10127.40	10000 10000 ? ? ? ? ? 10000 ? ? 10000 ? ? ? 10000 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422400286.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-COL-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422400286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.9K Apr 14 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 14 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 14 00:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 14 00:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 14 22:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 14 22:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 14 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 14 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 447K May 18 16:43 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-COL-010000-UpperBounds-00
FORMULA_NAME Philosophers-COL-010000-UpperBounds-01
FORMULA_NAME Philosophers-COL-010000-UpperBounds-02
FORMULA_NAME Philosophers-COL-010000-UpperBounds-03
FORMULA_NAME Philosophers-COL-010000-UpperBounds-04
FORMULA_NAME Philosophers-COL-010000-UpperBounds-05
FORMULA_NAME Philosophers-COL-010000-UpperBounds-06
FORMULA_NAME Philosophers-COL-010000-UpperBounds-07
FORMULA_NAME Philosophers-COL-010000-UpperBounds-08
FORMULA_NAME Philosophers-COL-010000-UpperBounds-09
FORMULA_NAME Philosophers-COL-010000-UpperBounds-10
FORMULA_NAME Philosophers-COL-010000-UpperBounds-11
FORMULA_NAME Philosophers-COL-010000-UpperBounds-12
FORMULA_NAME Philosophers-COL-010000-UpperBounds-13
FORMULA_NAME Philosophers-COL-010000-UpperBounds-14
FORMULA_NAME Philosophers-COL-010000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716971465922

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-010000
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-29 08:31:09] [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]
[2024-05-29 08:31:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 08:31:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-29 08:31:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 08:31:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 916 ms
[2024-05-29 08:31:10] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50000 PT places and 50000.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2024-05-29 08:31:10] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-29 08:31:10] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2024-05-29 08:31:10] [INFO ] Computed 2 invariants in 5 ms
FORMULA Philosophers-COL-010000-UpperBounds-14 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-10 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-07 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-01 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-29 08:31:10] [INFO ] Invariant cache hit.
[2024-05-29 08:31:10] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-29 08:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-29 08:31:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-29 08:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:10] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-29 08:31:10] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 08:31:10] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 08:31:11] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 08:31:11] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 5 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 08:31:11] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 08:31:11] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 08:31:11] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 08:31:11] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 08:31:11] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 08:31:11] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 08:31:11] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-29 08:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 08:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 08:31:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-29 08:31:11] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 08:31:11] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [10000, 5000, 5000, 10000, 5000, 10000, 10000, 10000, 5000, 10000, 5000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10000) 10000) 10000)]] contains successor/predecessor on variables of sort Philo
[2024-05-29 08:31:12] [INFO ] Unfolded HLPN to a Petri net with 50000 places and 50000 transitions 160000 arcs in 694 ms.
[2024-05-29 08:31:12] [INFO ] Unfolded 11 HLPN properties in 16 ms.
Finished random walk after 3369 steps, including 1 resets, run visited all 11 properties in 30007 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5579 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5496 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5589 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5138 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5865 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5203 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5320 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5801 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5269 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5384 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5860 ms. (steps per millisecond=1 ) properties seen 4
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 08:32:44] [INFO ] Computed 20000 invariants in 355 ms
[2024-05-29 08:32:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:32:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:32:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:09] [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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:14] [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 5
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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:24] [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 7
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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:29] [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 8
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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 08:33:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000, 5000, 5000, 10000, 5000, 10000, 10000, 10000, 5000, 10000, 5000] Max seen :[1324, 285, 285, 1324, 285, 1395, 1324, 1395, 285, 1324, 285]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 632 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2024-05-29 08:33:40] [INFO ] Invariant cache hit.
Finished random walk after 3921 steps, including 0 resets, run visited all 11 properties in 30006 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5748 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5093 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5169 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5956 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5796 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5591 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5223 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5176 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5285 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5391 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5298 ms. (steps per millisecond=1 ) properties seen 4
[2024-05-29 08:35:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 5000, 5000, 10000, 5000, 10000, 10000, 10000, 5000, 10000, 5000] Max seen :[1530, 358, 358, 1530, 358, 1593, 1530, 1593, 358, 1530, 358]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 323 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 261 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2024-05-29 08:37:11] [INFO ] Invariant cache hit.
[2024-05-29 08:37:17] [INFO ] Implicit Places using invariants in 5842 ms returned []
Implicit Place search using SMT only with invariants took 5843 ms to find 0 implicit places.
[2024-05-29 08:37:17] [INFO ] Invariant cache hit.
[2024-05-29 08:37:23] [INFO ] Dead Transitions using invariants and state equation in 6257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12371 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2024-05-29 08:37:23] [INFO ] Invariant cache hit.
Finished random walk after 3784 steps, including 0 resets, run visited all 11 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5524 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5936 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5304 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5133 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5505 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5225 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5431 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5271 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5195 ms. (steps per millisecond=1 ) properties seen 4
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5109 ms. (steps per millisecond=1 ) properties seen 4
[2024-05-29 08:38:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 5000, 5000, 10000, 5000, 10000, 10000, 10000, 5000, 10000, 5000] Max seen :[1530, 358, 358, 1530, 358, 1593, 1530, 1593, 358, 1530, 358]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 242 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 286 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2024-05-29 08:40:57] [INFO ] Invariant cache hit.
[2024-05-29 08:41:03] [INFO ] Implicit Places using invariants in 6617 ms returned []
Implicit Place search using SMT only with invariants took 6622 ms to find 0 implicit places.
[2024-05-29 08:41:03] [INFO ] Invariant cache hit.
[2024-05-29 08:41:10] [INFO ] Dead Transitions using invariants and state equation in 6275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13197 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-02
[2024-05-29 08:41:10] [INFO ] Invariant cache hit.
Finished random walk after 7669 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5789 ms. (steps per millisecond=1 )
[2024-05-29 08:41:46] [INFO ] Invariant cache hit.
[2024-05-29 08:41:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1378]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 27756 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27757 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 08:42:19] [INFO ] Computed 20000 invariants in 69 ms
Finished random walk after 11932 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5621 ms. (steps per millisecond=1 )
[2024-05-29 08:42:54] [INFO ] Invariant cache hit.
[2024-05-29 08:43:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 38443 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6127]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 172 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 248 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:43:40] [INFO ] Invariant cache hit.
[2024-05-29 08:43:44] [INFO ] Implicit Places using invariants in 3873 ms returned []
Implicit Place search using SMT only with invariants took 3875 ms to find 0 implicit places.
[2024-05-29 08:43:44] [INFO ] Invariant cache hit.
[2024-05-29 08:43:48] [INFO ] Dead Transitions using invariants and state equation in 3822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7947 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:43:48] [INFO ] Invariant cache hit.
Finished random walk after 11289 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 5001 steps, including 0 resets, run visited all 1 properties in 5190 ms. (steps per millisecond=0 )
[2024-05-29 08:44:23] [INFO ] Invariant cache hit.
[2024-05-29 08:45:08] [INFO ] [Real]Absence check using 20000 positive place invariants in 39654 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6130]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 243 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 151 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:45:08] [INFO ] Invariant cache hit.
[2024-05-29 08:45:12] [INFO ] Implicit Places using invariants in 3566 ms returned []
Implicit Place search using SMT only with invariants took 3570 ms to find 0 implicit places.
[2024-05-29 08:45:12] [INFO ] Invariant cache hit.
[2024-05-29 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 3503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7231 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:45:15] [INFO ] Invariant cache hit.
Finished random walk after 11917 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5542 ms. (steps per millisecond=1 )
[2024-05-29 08:45:51] [INFO ] Invariant cache hit.
[2024-05-29 08:46:36] [INFO ] [Real]Absence check using 20000 positive place invariants in 39373 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6147]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:46:36] [INFO ] Invariant cache hit.
[2024-05-29 08:46:40] [INFO ] Implicit Places using invariants in 3879 ms returned []
Implicit Place search using SMT only with invariants took 3884 ms to find 0 implicit places.
[2024-05-29 08:46:40] [INFO ] Invariant cache hit.
[2024-05-29 08:46:44] [INFO ] Dead Transitions using invariants and state equation in 3925 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7944 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:46:44] [INFO ] Invariant cache hit.
Finished random walk after 11780 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 6001 steps, including 0 resets, run visited all 1 properties in 5040 ms. (steps per millisecond=1 )
[2024-05-29 08:47:19] [INFO ] Invariant cache hit.
[2024-05-29 08:48:04] [INFO ] [Real]Absence check using 20000 positive place invariants in 39109 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6147]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 195 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:48:05] [INFO ] Invariant cache hit.
[2024-05-29 08:48:09] [INFO ] Implicit Places using invariants in 3930 ms returned []
Implicit Place search using SMT only with invariants took 3931 ms to find 0 implicit places.
[2024-05-29 08:48:09] [INFO ] Invariant cache hit.
[2024-05-29 08:48:13] [INFO ] Dead Transitions using invariants and state equation in 4011 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8143 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-02 in 422947 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 08:48:13] [INFO ] Computed 20000 invariants in 178 ms
Finished random walk after 7927 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5352 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 08:48:48] [INFO ] Invariant cache hit.
[2024-05-29 08:48:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[261]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 45899 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45901 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 08:49:39] [INFO ] Computed 20000 invariants in 58 ms
Finished random walk after 14916 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5350 ms. (steps per millisecond=1 )
[2024-05-29 08:50:15] [INFO ] Invariant cache hit.
[2024-05-29 08:51:00] [INFO ] [Real]Absence check using 20000 positive place invariants in 39209 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2816]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 191 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:51:00] [INFO ] Invariant cache hit.
[2024-05-29 08:51:04] [INFO ] Implicit Places using invariants in 3858 ms returned []
Implicit Place search using SMT only with invariants took 3860 ms to find 0 implicit places.
[2024-05-29 08:51:04] [INFO ] Invariant cache hit.
[2024-05-29 08:51:08] [INFO ] Dead Transitions using invariants and state equation in 3949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8004 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:51:08] [INFO ] Invariant cache hit.
Finished random walk after 14842 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5167 ms. (steps per millisecond=1 )
[2024-05-29 08:51:43] [INFO ] Invariant cache hit.
[2024-05-29 08:52:28] [INFO ] [Real]Absence check using 20000 positive place invariants in 39627 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2816]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 179 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:52:29] [INFO ] Invariant cache hit.
[2024-05-29 08:52:33] [INFO ] Implicit Places using invariants in 4097 ms returned []
Implicit Place search using SMT only with invariants took 4101 ms to find 0 implicit places.
[2024-05-29 08:52:33] [INFO ] Invariant cache hit.
[2024-05-29 08:52:37] [INFO ] Dead Transitions using invariants and state equation in 4052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8303 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-03 in 264060 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 08:52:37] [INFO ] Computed 20000 invariants in 152 ms
Finished random walk after 7830 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5559 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 08:53:13] [INFO ] Invariant cache hit.
[2024-05-29 08:53:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[272]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 49022 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49023 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 08:54:07] [INFO ] Computed 20000 invariants in 57 ms
Finished random walk after 14654 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5190 ms. (steps per millisecond=1 )
[2024-05-29 08:54:42] [INFO ] Invariant cache hit.
[2024-05-29 08:55:27] [INFO ] [Real]Absence check using 20000 positive place invariants in 38493 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2763]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 235 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 225 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:55:28] [INFO ] Invariant cache hit.
[2024-05-29 08:55:32] [INFO ] Implicit Places using invariants in 3995 ms returned []
Implicit Place search using SMT only with invariants took 4000 ms to find 0 implicit places.
[2024-05-29 08:55:32] [INFO ] Invariant cache hit.
[2024-05-29 08:55:36] [INFO ] Dead Transitions using invariants and state equation in 4036 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8263 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:55:36] [INFO ] Invariant cache hit.
Finished random walk after 14913 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5457 ms. (steps per millisecond=1 )
[2024-05-29 08:56:11] [INFO ] Invariant cache hit.
[2024-05-29 08:56:56] [INFO ] [Real]Absence check using 20000 positive place invariants in 38926 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2831]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 188 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:56:57] [INFO ] Invariant cache hit.
[2024-05-29 08:57:00] [INFO ] Implicit Places using invariants in 3949 ms returned []
Implicit Place search using SMT only with invariants took 3950 ms to find 0 implicit places.
[2024-05-29 08:57:00] [INFO ] Invariant cache hit.
[2024-05-29 08:57:04] [INFO ] Dead Transitions using invariants and state equation in 3869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7957 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 08:57:04] [INFO ] Invariant cache hit.
Finished random walk after 14906 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5360 ms. (steps per millisecond=1 )
[2024-05-29 08:57:40] [INFO ] Invariant cache hit.
[2024-05-29 08:58:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 39040 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2831]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 150 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 08:58:25] [INFO ] Invariant cache hit.
[2024-05-29 08:58:29] [INFO ] Implicit Places using invariants in 3912 ms returned []
Implicit Place search using SMT only with invariants took 3914 ms to find 0 implicit places.
[2024-05-29 08:58:29] [INFO ] Invariant cache hit.
[2024-05-29 08:58:33] [INFO ] Dead Transitions using invariants and state equation in 3645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7710 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-04 in 355881 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-05
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 08:58:33] [INFO ] Computed 20000 invariants in 210 ms
Finished random walk after 8072 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5342 ms. (steps per millisecond=1 )
[2024-05-29 08:59:08] [INFO ] Invariant cache hit.
[2024-05-29 08:59:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1385]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 27999 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27999 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 08:59:41] [INFO ] Computed 20000 invariants in 65 ms
Finished random walk after 11984 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5531 ms. (steps per millisecond=1 )
[2024-05-29 09:00:17] [INFO ] Invariant cache hit.
[2024-05-29 09:01:02] [INFO ] [Real]Absence check using 20000 positive place invariants in 39136 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6389]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 143 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:01:02] [INFO ] Invariant cache hit.
[2024-05-29 09:01:06] [INFO ] Implicit Places using invariants in 3832 ms returned []
Implicit Place search using SMT only with invariants took 3833 ms to find 0 implicit places.
[2024-05-29 09:01:06] [INFO ] Invariant cache hit.
[2024-05-29 09:01:10] [INFO ] Dead Transitions using invariants and state equation in 3962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7945 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:01:10] [INFO ] Invariant cache hit.
Finished random walk after 11695 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5224 ms. (steps per millisecond=1 )
[2024-05-29 09:01:46] [INFO ] Invariant cache hit.
[2024-05-29 09:02:31] [INFO ] [Real]Absence check using 20000 positive place invariants in 39171 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6389]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:02:31] [INFO ] Invariant cache hit.
[2024-05-29 09:02:35] [INFO ] Implicit Places using invariants in 3930 ms returned []
Implicit Place search using SMT only with invariants took 3931 ms to find 0 implicit places.
[2024-05-29 09:02:35] [INFO ] Invariant cache hit.
[2024-05-29 09:02:39] [INFO ] Dead Transitions using invariants and state equation in 3901 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7969 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-05 in 246055 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-06
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:02:39] [INFO ] Computed 20000 invariants in 149 ms
Finished random walk after 8035 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5491 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 09:03:15] [INFO ] Invariant cache hit.
[2024-05-29 09:03:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[254]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 45746 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45747 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:04:05] [INFO ] Computed 20000 invariants in 58 ms
Finished random walk after 14762 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5309 ms. (steps per millisecond=1 )
[2024-05-29 09:04:41] [INFO ] Invariant cache hit.
[2024-05-29 09:05:26] [INFO ] [Real]Absence check using 20000 positive place invariants in 38405 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2800]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 150 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 160 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:05:26] [INFO ] Invariant cache hit.
[2024-05-29 09:05:30] [INFO ] Implicit Places using invariants in 4127 ms returned []
Implicit Place search using SMT only with invariants took 4128 ms to find 0 implicit places.
[2024-05-29 09:05:30] [INFO ] Invariant cache hit.
[2024-05-29 09:05:34] [INFO ] Dead Transitions using invariants and state equation in 3902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8192 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:05:34] [INFO ] Invariant cache hit.
Finished random walk after 14695 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 6001 steps, including 0 resets, run visited all 1 properties in 5063 ms. (steps per millisecond=1 )
[2024-05-29 09:06:09] [INFO ] Invariant cache hit.
[2024-05-29 09:06:54] [INFO ] [Real]Absence check using 20000 positive place invariants in 38580 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2800]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 162 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:06:55] [INFO ] Invariant cache hit.
[2024-05-29 09:06:59] [INFO ] Implicit Places using invariants in 3956 ms returned []
Implicit Place search using SMT only with invariants took 3957 ms to find 0 implicit places.
[2024-05-29 09:06:59] [INFO ] Invariant cache hit.
[2024-05-29 09:07:03] [INFO ] Dead Transitions using invariants and state equation in 4069 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8159 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-06 in 263954 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-08
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:07:03] [INFO ] Computed 20000 invariants in 152 ms
Finished random walk after 7754 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5321 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 09:07:38] [INFO ] Invariant cache hit.
[2024-05-29 09:07:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1351]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 37766 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37767 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:08:21] [INFO ] Computed 20000 invariants in 65 ms
Finished random walk after 11957 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5346 ms. (steps per millisecond=1 )
[2024-05-29 09:08:57] [INFO ] Invariant cache hit.
[2024-05-29 09:09:42] [INFO ] [Real]Absence check using 20000 positive place invariants in 39035 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6196]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 198 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 197 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:09:42] [INFO ] Invariant cache hit.
[2024-05-29 09:09:46] [INFO ] Implicit Places using invariants in 3897 ms returned []
Implicit Place search using SMT only with invariants took 3898 ms to find 0 implicit places.
[2024-05-29 09:09:46] [INFO ] Invariant cache hit.
[2024-05-29 09:09:50] [INFO ] Dead Transitions using invariants and state equation in 3625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7725 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:09:50] [INFO ] Invariant cache hit.
Finished random walk after 11811 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5135 ms. (steps per millisecond=1 )
[2024-05-29 09:10:25] [INFO ] Invariant cache hit.
[2024-05-29 09:11:10] [INFO ] [Real]Absence check using 20000 positive place invariants in 39460 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6196]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 225 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:11:10] [INFO ] Invariant cache hit.
[2024-05-29 09:11:14] [INFO ] Implicit Places using invariants in 3831 ms returned []
Implicit Place search using SMT only with invariants took 3837 ms to find 0 implicit places.
[2024-05-29 09:11:14] [INFO ] Invariant cache hit.
[2024-05-29 09:11:18] [INFO ] Dead Transitions using invariants and state equation in 3746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7810 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-08 in 255202 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-09
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:11:18] [INFO ] Computed 20000 invariants in 192 ms
Finished random walk after 8038 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5788 ms. (steps per millisecond=1 )
[2024-05-29 09:11:54] [INFO ] Invariant cache hit.
[2024-05-29 09:11:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1382]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 33858 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33860 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:12:33] [INFO ] Computed 20000 invariants in 59 ms
Finished random walk after 11819 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5439 ms. (steps per millisecond=1 )
[2024-05-29 09:13:08] [INFO ] Invariant cache hit.
[2024-05-29 09:13:54] [INFO ] [Real]Absence check using 20000 positive place invariants in 38909 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6308]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 171 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 174 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:13:54] [INFO ] Invariant cache hit.
[2024-05-29 09:13:58] [INFO ] Implicit Places using invariants in 4471 ms returned []
Implicit Place search using SMT only with invariants took 4478 ms to find 0 implicit places.
[2024-05-29 09:13:58] [INFO ] Invariant cache hit.
[2024-05-29 09:14:03] [INFO ] Dead Transitions using invariants and state equation in 4227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8885 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:14:03] [INFO ] Invariant cache hit.
Finished random walk after 11592 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5202 ms. (steps per millisecond=1 )
[2024-05-29 09:14:38] [INFO ] Invariant cache hit.
[2024-05-29 09:15:23] [INFO ] [Real]Absence check using 20000 positive place invariants in 39059 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6308]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 207 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 204 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:15:23] [INFO ] Invariant cache hit.
[2024-05-29 09:15:27] [INFO ] Implicit Places using invariants in 3990 ms returned []
Implicit Place search using SMT only with invariants took 3991 ms to find 0 implicit places.
[2024-05-29 09:15:27] [INFO ] Invariant cache hit.
[2024-05-29 09:15:32] [INFO ] Dead Transitions using invariants and state equation in 4226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8422 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-09 in 253730 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-11
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:15:32] [INFO ] Computed 20000 invariants in 188 ms
Finished random walk after 7798 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 6001 steps, including 0 resets, run timeout after 5144 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 09:16:07] [INFO ] Invariant cache hit.
[2024-05-29 09:16:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1419]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 9 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 29549 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29549 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:16:42] [INFO ] Computed 20000 invariants in 48 ms
Finished random walk after 11544 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5427 ms. (steps per millisecond=1 )
[2024-05-29 09:17:17] [INFO ] Invariant cache hit.
[2024-05-29 09:18:02] [INFO ] [Real]Absence check using 20000 positive place invariants in 38664 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6099]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 134 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:18:03] [INFO ] Invariant cache hit.
[2024-05-29 09:18:06] [INFO ] Implicit Places using invariants in 3845 ms returned []
Implicit Place search using SMT only with invariants took 3846 ms to find 0 implicit places.
[2024-05-29 09:18:06] [INFO ] Invariant cache hit.
[2024-05-29 09:18:11] [INFO ] Dead Transitions using invariants and state equation in 4099 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8085 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:18:11] [INFO ] Invariant cache hit.
Finished random walk after 11754 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5640 ms. (steps per millisecond=1 )
[2024-05-29 09:18:46] [INFO ] Invariant cache hit.
[2024-05-29 09:19:31] [INFO ] [Real]Absence check using 20000 positive place invariants in 39005 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6197]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 127 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 126 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:19:32] [INFO ] Invariant cache hit.
[2024-05-29 09:19:36] [INFO ] Implicit Places using invariants in 3909 ms returned []
Implicit Place search using SMT only with invariants took 3913 ms to find 0 implicit places.
[2024-05-29 09:19:36] [INFO ] Invariant cache hit.
[2024-05-29 09:19:39] [INFO ] Dead Transitions using invariants and state equation in 3833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7874 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:19:39] [INFO ] Invariant cache hit.
Finished random walk after 12109 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5134 ms. (steps per millisecond=1 )
[2024-05-29 09:20:15] [INFO ] Invariant cache hit.
[2024-05-29 09:21:00] [INFO ] [Real]Absence check using 20000 positive place invariants in 39263 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6222]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 123 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:21:00] [INFO ] Invariant cache hit.
[2024-05-29 09:21:04] [INFO ] Implicit Places using invariants in 3709 ms returned []
Implicit Place search using SMT only with invariants took 3710 ms to find 0 implicit places.
[2024-05-29 09:21:04] [INFO ] Invariant cache hit.
[2024-05-29 09:21:07] [INFO ] Dead Transitions using invariants and state equation in 3745 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7580 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:21:07] [INFO ] Invariant cache hit.
Finished random walk after 11770 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5482 ms. (steps per millisecond=1 )
[2024-05-29 09:21:43] [INFO ] Invariant cache hit.
[2024-05-29 09:22:28] [INFO ] [Real]Absence check using 20000 positive place invariants in 39305 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6222]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 140 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 134 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:22:28] [INFO ] Invariant cache hit.
[2024-05-29 09:22:32] [INFO ] Implicit Places using invariants in 3809 ms returned []
Implicit Place search using SMT only with invariants took 3810 ms to find 0 implicit places.
[2024-05-29 09:22:32] [INFO ] Invariant cache hit.
[2024-05-29 09:22:36] [INFO ] Dead Transitions using invariants and state equation in 3826 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7771 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-11 in 424364 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-12
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:22:36] [INFO ] Computed 20000 invariants in 149 ms
Finished random walk after 7973 steps, including 2 resets, run visited all 1 properties in 30006 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5120 ms. (steps per millisecond=1 ) properties seen 0
[2024-05-29 09:23:11] [INFO ] Invariant cache hit.
[2024-05-29 09:23:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[267]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 42075 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42076 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:23:59] [INFO ] Computed 20000 invariants in 75 ms
Finished random walk after 14682 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5252 ms. (steps per millisecond=1 )
[2024-05-29 09:24:34] [INFO ] Invariant cache hit.
[2024-05-29 09:25:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 39497 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2797]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 171 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 189 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:25:19] [INFO ] Invariant cache hit.
[2024-05-29 09:25:24] [INFO ] Implicit Places using invariants in 4169 ms returned []
Implicit Place search using SMT only with invariants took 4170 ms to find 0 implicit places.
[2024-05-29 09:25:24] [INFO ] Invariant cache hit.
[2024-05-29 09:25:27] [INFO ] Dead Transitions using invariants and state equation in 3474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7835 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:25:27] [INFO ] Invariant cache hit.
Finished random walk after 14716 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5398 ms. (steps per millisecond=1 )
[2024-05-29 09:26:02] [INFO ] Invariant cache hit.
[2024-05-29 09:26:48] [INFO ] [Real]Absence check using 20000 positive place invariants in 39262 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2824]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 180 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 195 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:26:48] [INFO ] Invariant cache hit.
[2024-05-29 09:26:52] [INFO ] Implicit Places using invariants in 3896 ms returned []
Implicit Place search using SMT only with invariants took 3897 ms to find 0 implicit places.
[2024-05-29 09:26:52] [INFO ] Invariant cache hit.
[2024-05-29 09:26:56] [INFO ] Dead Transitions using invariants and state equation in 3829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7922 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:26:56] [INFO ] Invariant cache hit.
Finished random walk after 14751 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5388 ms. (steps per millisecond=1 )
[2024-05-29 09:27:31] [INFO ] Invariant cache hit.
[2024-05-29 09:28:16] [INFO ] [Real]Absence check using 20000 positive place invariants in 39248 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2824]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:28:16] [INFO ] Invariant cache hit.
[2024-05-29 09:28:20] [INFO ] Implicit Places using invariants in 3809 ms returned []
Implicit Place search using SMT only with invariants took 3810 ms to find 0 implicit places.
[2024-05-29 09:28:20] [INFO ] Invariant cache hit.
[2024-05-29 09:28:24] [INFO ] Dead Transitions using invariants and state equation in 3958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7906 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-12 in 348228 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-13
// Phase 1: matrix 50000 rows 50000 cols
[2024-05-29 09:28:24] [INFO ] Computed 20000 invariants in 152 ms
Finished random walk after 7829 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 7001 steps, including 0 resets, run visited all 1 properties in 5378 ms. (steps per millisecond=1 )
[2024-05-29 09:29:00] [INFO ] Invariant cache hit.
[2024-05-29 09:29:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:877)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [10000] Max seen :[1382]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 9 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 31766 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31767 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2024-05-29 09:29:37] [INFO ] Computed 20000 invariants in 54 ms
Finished random walk after 11743 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5670 ms. (steps per millisecond=1 )
[2024-05-29 09:30:12] [INFO ] Invariant cache hit.
[2024-05-29 09:30:58] [INFO ] [Real]Absence check using 20000 positive place invariants in 39494 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6132]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 123 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 122 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-29 09:30:58] [INFO ] Invariant cache hit.
[2024-05-29 09:31:01] [INFO ] Implicit Places using invariants in 3554 ms returned []
Implicit Place search using SMT only with invariants took 3555 ms to find 0 implicit places.
[2024-05-29 09:31:01] [INFO ] Invariant cache hit.
[2024-05-29 09:31:05] [INFO ] Dead Transitions using invariants and state equation in 3799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7479 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2024-05-29 09:31:05] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11142772 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16111120 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-COL-010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-COL-010000, 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 r285-smll-171654422400286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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