Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K Mar 5 18:22 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 FlexibleBarrier-PT-10b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678555966171

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 17:32:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 17:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:32:47] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-11 17:32:47] [INFO ] Transformed 1402 places.
[2023-03-11 17:32:47] [INFO ] Transformed 1613 transitions.
[2023-03-11 17:32:47] [INFO ] Found NUPN structural information;
[2023-03-11 17:32:47] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-11 17:32:48] [INFO ] Computed 12 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 132 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :3
FORMULA FlexibleBarrier-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
[2023-03-11 17:32:48] [INFO ] Invariant cache hit.
[2023-03-11 17:32:48] [INFO ] [Real]Absence check using 12 positive place invariants in 28 ms returned sat
[2023-03-11 17:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:32:49] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-11 17:32:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:32:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:32:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:32:50] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-11 17:32:50] [INFO ] Deduced a trap composed of 611 places in 496 ms of which 6 ms to minimize.
[2023-03-11 17:32:51] [INFO ] Deduced a trap composed of 70 places in 524 ms of which 1 ms to minimize.
[2023-03-11 17:32:51] [INFO ] Deduced a trap composed of 97 places in 419 ms of which 2 ms to minimize.
[2023-03-11 17:32:52] [INFO ] Deduced a trap composed of 468 places in 396 ms of which 1 ms to minimize.
[2023-03-11 17:32:52] [INFO ] Deduced a trap composed of 533 places in 453 ms of which 1 ms to minimize.
[2023-03-11 17:32:53] [INFO ] Deduced a trap composed of 222 places in 395 ms of which 1 ms to minimize.
[2023-03-11 17:32:53] [INFO ] Deduced a trap composed of 101 places in 385 ms of which 1 ms to minimize.
[2023-03-11 17:32:54] [INFO ] Deduced a trap composed of 103 places in 356 ms of which 1 ms to minimize.
[2023-03-11 17:32:54] [INFO ] Deduced a trap composed of 489 places in 357 ms of which 1 ms to minimize.
[2023-03-11 17:32:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:32:54] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:32:55] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2023-03-11 17:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:32:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-11 17:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:32:56] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2023-03-11 17:32:56] [INFO ] Deduced a trap composed of 542 places in 437 ms of which 1 ms to minimize.
[2023-03-11 17:32:57] [INFO ] Deduced a trap composed of 467 places in 377 ms of which 0 ms to minimize.
[2023-03-11 17:32:57] [INFO ] Deduced a trap composed of 494 places in 340 ms of which 1 ms to minimize.
[2023-03-11 17:32:57] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 0 ms to minimize.
[2023-03-11 17:32:58] [INFO ] Deduced a trap composed of 512 places in 367 ms of which 1 ms to minimize.
[2023-03-11 17:32:58] [INFO ] Deduced a trap composed of 468 places in 319 ms of which 1 ms to minimize.
[2023-03-11 17:32:59] [INFO ] Deduced a trap composed of 479 places in 363 ms of which 1 ms to minimize.
[2023-03-11 17:32:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2981 ms
[2023-03-11 17:32:59] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 102 ms.
[2023-03-11 17:33:01] [INFO ] Deduced a trap composed of 14 places in 607 ms of which 1 ms to minimize.
[2023-03-11 17:33:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:01] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:01] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2023-03-11 17:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned sat
[2023-03-11 17:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:02] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2023-03-11 17:33:03] [INFO ] Deduced a trap composed of 519 places in 375 ms of which 1 ms to minimize.
[2023-03-11 17:33:03] [INFO ] Deduced a trap composed of 172 places in 416 ms of which 1 ms to minimize.
[2023-03-11 17:33:04] [INFO ] Deduced a trap composed of 104 places in 355 ms of which 1 ms to minimize.
[2023-03-11 17:33:04] [INFO ] Deduced a trap composed of 106 places in 362 ms of which 1 ms to minimize.
[2023-03-11 17:33:04] [INFO ] Deduced a trap composed of 177 places in 412 ms of which 9 ms to minimize.
[2023-03-11 17:33:05] [INFO ] Deduced a trap composed of 101 places in 358 ms of which 1 ms to minimize.
[2023-03-11 17:33:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2631 ms
[2023-03-11 17:33:05] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 96 ms.
[2023-03-11 17:33:07] [INFO ] Deduced a trap composed of 14 places in 587 ms of which 1 ms to minimize.
[2023-03-11 17:33:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:07] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:08] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-11 17:33:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:09] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2023-03-11 17:33:09] [INFO ] Deduced a trap composed of 243 places in 437 ms of which 1 ms to minimize.
[2023-03-11 17:33:10] [INFO ] Deduced a trap composed of 198 places in 396 ms of which 1 ms to minimize.
[2023-03-11 17:33:10] [INFO ] Deduced a trap composed of 490 places in 379 ms of which 1 ms to minimize.
[2023-03-11 17:33:10] [INFO ] Deduced a trap composed of 220 places in 328 ms of which 1 ms to minimize.
[2023-03-11 17:33:11] [INFO ] Deduced a trap composed of 108 places in 364 ms of which 1 ms to minimize.
[2023-03-11 17:33:11] [INFO ] Deduced a trap composed of 102 places in 362 ms of which 1 ms to minimize.
[2023-03-11 17:33:12] [INFO ] Deduced a trap composed of 172 places in 379 ms of which 1 ms to minimize.
[2023-03-11 17:33:12] [INFO ] Deduced a trap composed of 101 places in 351 ms of which 1 ms to minimize.
[2023-03-11 17:33:12] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 0 ms to minimize.
[2023-03-11 17:33:13] [INFO ] Deduced a trap composed of 105 places in 341 ms of which 1 ms to minimize.
[2023-03-11 17:33:13] [INFO ] Deduced a trap composed of 497 places in 344 ms of which 1 ms to minimize.
[2023-03-11 17:33:13] [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 3
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:13] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-11 17:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:14] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-11 17:33:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:15] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-11 17:33:15] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 81 ms.
[2023-03-11 17:33:19] [INFO ] Added : 261 causal constraints over 53 iterations in 4037 ms. Result :sat
Minimization took 167 ms.
[2023-03-11 17:33:19] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-11 17:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:20] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2023-03-11 17:33:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:20] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-11 17:33:21] [INFO ] Deduced a trap composed of 503 places in 416 ms of which 1 ms to minimize.
[2023-03-11 17:33:21] [INFO ] Deduced a trap composed of 500 places in 373 ms of which 1 ms to minimize.
[2023-03-11 17:33:22] [INFO ] Deduced a trap composed of 466 places in 345 ms of which 1 ms to minimize.
[2023-03-11 17:33:22] [INFO ] Deduced a trap composed of 502 places in 403 ms of which 1 ms to minimize.
[2023-03-11 17:33:23] [INFO ] Deduced a trap composed of 477 places in 359 ms of which 1 ms to minimize.
[2023-03-11 17:33:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2215 ms
[2023-03-11 17:33:23] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 84 ms.
[2023-03-11 17:33:25] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:25] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-11 17:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:25] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2023-03-11 17:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-11 17:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:26] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-11 17:33:27] [INFO ] Deduced a trap composed of 512 places in 471 ms of which 1 ms to minimize.
[2023-03-11 17:33:27] [INFO ] Deduced a trap composed of 176 places in 438 ms of which 1 ms to minimize.
[2023-03-11 17:33:28] [INFO ] Deduced a trap composed of 477 places in 359 ms of which 1 ms to minimize.
[2023-03-11 17:33:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1481 ms
[2023-03-11 17:33:28] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 79 ms.
[2023-03-11 17:33:31] [INFO ] Deduced a trap composed of 14 places in 606 ms of which 1 ms to minimize.
[2023-03-11 17:33:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:31] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-11 17:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:32] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-11 17:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:33] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-11 17:33:33] [INFO ] Deduced a trap composed of 488 places in 410 ms of which 1 ms to minimize.
[2023-03-11 17:33:34] [INFO ] Deduced a trap composed of 510 places in 432 ms of which 1 ms to minimize.
[2023-03-11 17:33:34] [INFO ] Deduced a trap composed of 547 places in 382 ms of which 1 ms to minimize.
[2023-03-11 17:33:34] [INFO ] Deduced a trap composed of 488 places in 337 ms of which 1 ms to minimize.
[2023-03-11 17:33:35] [INFO ] Deduced a trap composed of 98 places in 329 ms of which 0 ms to minimize.
[2023-03-11 17:33:35] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 0 ms to minimize.
[2023-03-11 17:33:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2689 ms
[2023-03-11 17:33:35] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 67 ms.
[2023-03-11 17:33:38] [INFO ] Deduced a trap composed of 14 places in 555 ms of which 1 ms to minimize.
[2023-03-11 17:33:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:38] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:38] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2023-03-11 17:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:39] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-11 17:33:39] [INFO ] Deduced a trap composed of 171 places in 382 ms of which 1 ms to minimize.
[2023-03-11 17:33:40] [INFO ] Deduced a trap composed of 476 places in 353 ms of which 1 ms to minimize.
[2023-03-11 17:33:40] [INFO ] Deduced a trap composed of 479 places in 344 ms of which 1 ms to minimize.
[2023-03-11 17:33:41] [INFO ] Deduced a trap composed of 548 places in 323 ms of which 1 ms to minimize.
[2023-03-11 17:33:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1646 ms
[2023-03-11 17:33:41] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 82 ms.
[2023-03-11 17:33:43] [INFO ] Added : 180 causal constraints over 36 iterations in 2613 ms. Result :unknown
[2023-03-11 17:33:44] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:44] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-11 17:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-11 17:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:45] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-11 17:33:45] [INFO ] Deduced a trap composed of 465 places in 452 ms of which 1 ms to minimize.
[2023-03-11 17:33:46] [INFO ] Deduced a trap composed of 475 places in 425 ms of which 4 ms to minimize.
[2023-03-11 17:33:46] [INFO ] Deduced a trap composed of 486 places in 371 ms of which 1 ms to minimize.
[2023-03-11 17:33:47] [INFO ] Deduced a trap composed of 494 places in 367 ms of which 1 ms to minimize.
[2023-03-11 17:33:47] [INFO ] Deduced a trap composed of 470 places in 335 ms of which 1 ms to minimize.
[2023-03-11 17:33:47] [INFO ] Deduced a trap composed of 472 places in 357 ms of which 1 ms to minimize.
[2023-03-11 17:33:48] [INFO ] Deduced a trap composed of 443 places in 330 ms of which 0 ms to minimize.
[2023-03-11 17:33:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3040 ms
[2023-03-11 17:33:48] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 86 ms.
[2023-03-11 17:33:50] [INFO ] Deduced a trap composed of 14 places in 573 ms of which 1 ms to minimize.
[2023-03-11 17:33:50] [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 9
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:33:50] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-11 17:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:50] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-11 17:33:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:33:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-11 17:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:33:51] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-11 17:33:51] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 79 ms.
[2023-03-11 17:33:56] [INFO ] Deduced a trap composed of 14 places in 581 ms of which 2 ms to minimize.
[2023-03-11 17:33:56] [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 10
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1354 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 7 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 354 place count 1350 transition count 1197
Reduce places removed 353 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 354 rules applied. Total rules applied 708 place count 997 transition count 1196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 709 place count 996 transition count 1196
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 709 place count 996 transition count 1109
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 883 place count 909 transition count 1109
Discarding 504 places :
Symmetric choice reduction at 3 with 504 rule applications. Total rules 1387 place count 405 transition count 605
Iterating global reduction 3 with 504 rules applied. Total rules applied 1891 place count 405 transition count 605
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1891 place count 405 transition count 597
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1907 place count 397 transition count 597
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 1985 place count 319 transition count 519
Iterating global reduction 3 with 78 rules applied. Total rules applied 2063 place count 319 transition count 519
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 2139 place count 319 transition count 443
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2247 place count 265 transition count 389
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2267 place count 265 transition count 369
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2277 place count 255 transition count 359
Iterating global reduction 5 with 10 rules applied. Total rules applied 2287 place count 255 transition count 359
Free-agglomeration rule applied 187 times.
Iterating global reduction 5 with 187 rules applied. Total rules applied 2474 place count 255 transition count 172
Reduce places removed 187 places and 0 transitions.
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 184 edges and 68 vertex of which 63 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 265 rules applied. Total rules applied 2739 place count 63 transition count 95
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2746 place count 63 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2747 place count 62 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 61 vertex of which 18 / 61 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2749 place count 52 transition count 87
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2767 place count 52 transition count 69
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2767 place count 52 transition count 60
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2785 place count 43 transition count 60
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 2794 place count 43 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 2812 place count 34 transition count 42
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 2821 place count 34 transition count 33
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 2843 place count 21 transition count 24
Applied a total of 2843 rules in 259 ms. Remains 21 /1402 variables (removed 1381) and now considering 24/1613 (removed 1589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 21/1402 places, 24/1613 transitions.
// Phase 1: matrix 24 rows 21 cols
[2023-03-11 17:33:56] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 9) seen :9
FORMULA FlexibleBarrier-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 70255 ms.
ITS solved all properties within timeout

BK_STOP 1678556038767

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-10b, 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 r169-tall-167838856000501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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