About the Execution of Smart+red for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1943.563 | 625503.00 | 717846.00 | 92.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718600333.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600333
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679563783532
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 09:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:29:46] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-23 09:29:47] [INFO ] Transformed 3503 places.
[2023-03-23 09:29:47] [INFO ] Transformed 3253 transitions.
[2023-03-23 09:29:47] [INFO ] Found NUPN structural information;
[2023-03-23 09:29:47] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-23 09:29:47] [INFO ] Computed 451 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
[2023-03-23 09:29:47] [INFO ] Invariant cache hit.
[2023-03-23 09:29:49] [INFO ] [Real]Absence check using 451 positive place invariants in 393 ms returned sat
[2023-03-23 09:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:29:52] [INFO ] [Real]Absence check using state equation in 3654 ms returned unknown
[2023-03-23 09:29:54] [INFO ] [Real]Absence check using 451 positive place invariants in 276 ms returned sat
[2023-03-23 09:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:29:57] [INFO ] [Real]Absence check using state equation in 3202 ms returned sat
[2023-03-23 09:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:29:58] [INFO ] [Nat]Absence check using 451 positive place invariants in 265 ms returned sat
[2023-03-23 09:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:01] [INFO ] [Nat]Absence check using state equation in 3165 ms returned sat
[2023-03-23 09:30:04] [INFO ] Deduced a trap composed of 22 places in 2246 ms of which 5 ms to minimize.
[2023-03-23 09:30: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: 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.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-23 09:30:04] [INFO ] [Real]Absence check using 451 positive place invariants in 296 ms returned sat
[2023-03-23 09:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:07] [INFO ] [Real]Absence check using state equation in 2691 ms returned sat
[2023-03-23 09:30:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:30:09] [INFO ] [Nat]Absence check using 451 positive place invariants in 448 ms returned sat
[2023-03-23 09:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:12] [INFO ] [Nat]Absence check using state equation in 2924 ms returned sat
[2023-03-23 09:30:13] [INFO ] Deduced a trap composed of 13 places in 1120 ms of which 2 ms to minimize.
[2023-03-23 09:30: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 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.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-23 09:30:14] [INFO ] [Real]Absence check using 451 positive place invariants in 212 ms returned sat
[2023-03-23 09:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:15] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2023-03-23 09:30:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:30:16] [INFO ] [Nat]Absence check using 451 positive place invariants in 204 ms returned sat
[2023-03-23 09:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:18] [INFO ] [Nat]Absence check using state equation in 1881 ms returned sat
[2023-03-23 09:30:20] [INFO ] Deduced a trap composed of 33 places in 1738 ms of which 3 ms to minimize.
[2023-03-23 09:30:22] [INFO ] Deduced a trap composed of 22 places in 1667 ms of which 16 ms to minimize.
[2023-03-23 09:30:22] [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-23 09:30:23] [INFO ] [Real]Absence check using 451 positive place invariants in 298 ms returned sat
[2023-03-23 09:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:25] [INFO ] [Real]Absence check using state equation in 2391 ms returned sat
[2023-03-23 09:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:30:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 712 ms returned sat
[2023-03-23 09:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:30] [INFO ] [Nat]Absence check using state equation in 2555 ms returned sat
[2023-03-23 09:30:31] [INFO ] Deduced a trap composed of 22 places in 1453 ms of which 3 ms to minimize.
[2023-03-23 09:30: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 4
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-23 09:30:34] [INFO ] [Real]Absence check using 451 positive place invariants in 1638 ms returned sat
[2023-03-23 09:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:30:36] [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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 850 transitions
Trivial Post-agglo rules discarded 850 transitions
Performed 850 trivial Post agglomeration. Transition count delta: 850
Iterating post reduction 0 with 850 rules applied. Total rules applied 850 place count 3503 transition count 2403
Reduce places removed 850 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 852 rules applied. Total rules applied 1702 place count 2653 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1703 place count 2652 transition count 2401
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1703 place count 2652 transition count 2201
Deduced a syphon composed of 200 places in 9 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2103 place count 2452 transition count 2201
Discarding 347 places :
Symmetric choice reduction at 3 with 347 rule applications. Total rules 2450 place count 2105 transition count 1854
Iterating global reduction 3 with 347 rules applied. Total rules applied 2797 place count 2105 transition count 1854
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 2797 place count 2105 transition count 1707
Deduced a syphon composed of 147 places in 10 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 3091 place count 1958 transition count 1707
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 2 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 4795 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4997 place count 1005 transition count 918
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 5089 place count 959 transition count 949
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5090 place count 959 transition count 948
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 5140 place count 959 transition count 948
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5141 place count 958 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 5143 place count 956 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 5143 place count 956 transition count 946
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5145 place count 955 transition count 946
Applied a total of 5145 rules in 1124 ms. Remains 955 /3503 variables (removed 2548) and now considering 946/3253 (removed 2307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 955/3503 places, 946/3253 transitions.
// Phase 1: matrix 946 rows 955 cols
[2023-03-23 09:30:37] [INFO ] Computed 449 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8469 ms. (steps per millisecond=118 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 899580 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen 0
Interrupted Best-First random walk after 885070 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Interrupted Best-First random walk after 810033 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 919766 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted Best-First random walk after 926013 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
[2023-03-23 09:31:11] [INFO ] Invariant cache hit.
[2023-03-23 09:31:11] [INFO ] [Real]Absence check using 449 positive place invariants in 250 ms returned sat
[2023-03-23 09:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:31:12] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-23 09:31:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:31:12] [INFO ] [Nat]Absence check using 449 positive place invariants in 89 ms returned sat
[2023-03-23 09:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:31:13] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2023-03-23 09:31:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 09:31:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-23 09:31:13] [INFO ] Computed and/alt/rep : 943/1684/943 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-23 09:31:32] [INFO ] Added : 864 causal constraints over 174 iterations in 18301 ms. Result :sat
Minimization took 3010 ms.
[2023-03-23 09:31:35] [INFO ] [Real]Absence check using 449 positive place invariants in 133 ms returned sat
[2023-03-23 09:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:31:35] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-23 09:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:31:36] [INFO ] [Nat]Absence check using 449 positive place invariants in 73 ms returned sat
[2023-03-23 09:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:31:36] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-23 09:31:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2023-03-23 09:31:36] [INFO ] Computed and/alt/rep : 943/1684/943 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-23 09:31:55] [INFO ] Added : 852 causal constraints over 171 iterations in 19278 ms. Result :sat
Minimization took 3001 ms.
[2023-03-23 09:31:59] [INFO ] [Real]Absence check using 449 positive place invariants in 93 ms returned sat
[2023-03-23 09:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:31:59] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2023-03-23 09:31:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:31:59] [INFO ] [Nat]Absence check using 449 positive place invariants in 101 ms returned sat
[2023-03-23 09:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:32:00] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-23 09:32:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 09:32:00] [INFO ] Computed and/alt/rep : 943/1684/943 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-23 09:32:19] [INFO ] Added : 862 causal constraints over 174 iterations in 19170 ms. Result :sat
Minimization took 3001 ms.
[2023-03-23 09:32:22] [INFO ] [Real]Absence check using 449 positive place invariants in 97 ms returned sat
[2023-03-23 09:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:32:23] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-23 09:32:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:32:23] [INFO ] [Nat]Absence check using 449 positive place invariants in 66 ms returned sat
[2023-03-23 09:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:32:23] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-23 09:32:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 09:32:23] [INFO ] Computed and/alt/rep : 943/1684/943 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-23 09:32:41] [INFO ] Added : 856 causal constraints over 172 iterations in 17962 ms. Result :sat
Minimization took 3024 ms.
[2023-03-23 09:32:45] [INFO ] [Real]Absence check using 449 positive place invariants in 137 ms returned sat
[2023-03-23 09:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:32:45] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-23 09:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:32:46] [INFO ] [Nat]Absence check using 449 positive place invariants in 171 ms returned sat
[2023-03-23 09:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:32:46] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2023-03-23 09:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 09:32:46] [INFO ] Computed and/alt/rep : 943/1684/943 causal constraints (skipped 0 transitions) in 101 ms.
[2023-03-23 09:33:03] [INFO ] Added : 861 causal constraints over 173 iterations in 16827 ms. Result :sat
Minimization took 3008 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 946/946 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 955 transition count 945
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 954 transition count 945
Applied a total of 2 rules in 30 ms. Remains 954 /955 variables (removed 1) and now considering 945/946 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 954/955 places, 945/946 transitions.
// Phase 1: matrix 945 rows 954 cols
[2023-03-23 09:33:06] [INFO ] Computed 449 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7763 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 920586 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen 0
Interrupted Best-First random walk after 948187 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Interrupted Best-First random walk after 909780 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 0
Interrupted Best-First random walk after 941520 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 1
FORMULA ShieldIIPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-23 09:33:34] [INFO ] Invariant cache hit.
[2023-03-23 09:33:34] [INFO ] [Real]Absence check using 449 positive place invariants in 84 ms returned sat
[2023-03-23 09:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:33:34] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-23 09:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:33:35] [INFO ] [Nat]Absence check using 449 positive place invariants in 60 ms returned sat
[2023-03-23 09:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:33:35] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-23 09:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 09:33:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 09:33:35] [INFO ] Computed and/alt/rep : 942/1683/942 causal constraints (skipped 0 transitions) in 120 ms.
[2023-03-23 09:33:55] [INFO ] Added : 850 causal constraints over 171 iterations in 20096 ms. Result :sat
Minimization took 2439 ms.
[2023-03-23 09:33:58] [INFO ] [Real]Absence check using 449 positive place invariants in 107 ms returned sat
[2023-03-23 09:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:33:59] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-23 09:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:33:59] [INFO ] [Nat]Absence check using 449 positive place invariants in 130 ms returned sat
[2023-03-23 09:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:33:59] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-23 09:33:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2023-03-23 09:34:00] [INFO ] Computed and/alt/rep : 942/1683/942 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-23 09:34:18] [INFO ] Added : 846 causal constraints over 170 iterations in 18939 ms. Result :sat
Minimization took 1956 ms.
[2023-03-23 09:34:21] [INFO ] [Real]Absence check using 449 positive place invariants in 80 ms returned sat
[2023-03-23 09:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:34:21] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2023-03-23 09:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:34:22] [INFO ] [Nat]Absence check using 449 positive place invariants in 102 ms returned sat
[2023-03-23 09:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:34:22] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2023-03-23 09:34:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 09:34:22] [INFO ] Computed and/alt/rep : 942/1683/942 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-23 09:34:39] [INFO ] Added : 859 causal constraints over 172 iterations in 16576 ms. Result :sat
Minimization took 2699 ms.
[2023-03-23 09:34:42] [INFO ] [Real]Absence check using 449 positive place invariants in 95 ms returned sat
[2023-03-23 09:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:34:42] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-23 09:34:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 09:34:42] [INFO ] Computed and/alt/rep : 942/1683/942 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-23 09:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:34:43] [INFO ] [Nat]Absence check using 449 positive place invariants in 167 ms returned sat
[2023-03-23 09:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:34:43] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-23 09:34:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 09:34:44] [INFO ] Computed and/alt/rep : 942/1683/942 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-23 09:34:59] [INFO ] Added : 856 causal constraints over 172 iterations in 15451 ms. Result :sat
Minimization took 611 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ShieldIIPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 945/945 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 954 transition count 944
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 953 transition count 944
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 951 transition count 942
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 949 transition count 944
Applied a total of 10 rules in 72 ms. Remains 949 /954 variables (removed 5) and now considering 944/945 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 949/954 places, 944/945 transitions.
// Phase 1: matrix 944 rows 949 cols
[2023-03-23 09:35:04] [INFO ] Computed 449 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7664 ms. (steps per millisecond=130 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 937332 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen 0
[2023-03-23 09:35:17] [INFO ] Invariant cache hit.
[2023-03-23 09:35:17] [INFO ] [Real]Absence check using 449 positive place invariants in 136 ms returned sat
[2023-03-23 09:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:35:18] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2023-03-23 09:35:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 09:35:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 09:35:18] [INFO ] Computed and/alt/rep : 941/1686/941 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-23 09:35:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:35:19] [INFO ] [Nat]Absence check using 449 positive place invariants in 79 ms returned sat
[2023-03-23 09:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:35:19] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2023-03-23 09:35:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 09:35:19] [INFO ] Computed and/alt/rep : 941/1686/941 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-23 09:35:34] [INFO ] Added : 849 causal constraints over 170 iterations in 15316 ms. Result :sat
Minimization took 2591 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 944/944 transitions.
Applied a total of 0 rules in 20 ms. Remains 949 /949 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 949/949 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 944/944 transitions.
Applied a total of 0 rules in 18 ms. Remains 949 /949 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2023-03-23 09:35:39] [INFO ] Invariant cache hit.
[2023-03-23 09:35:39] [INFO ] Implicit Places using invariants in 722 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 725 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 948/949 places, 944/944 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 943
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 943
Applied a total of 2 rules in 31 ms. Remains 947 /948 variables (removed 1) and now considering 943/944 (removed 1) transitions.
// Phase 1: matrix 943 rows 947 cols
[2023-03-23 09:35:40] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-23 09:35:40] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-23 09:35:40] [INFO ] Invariant cache hit.
[2023-03-23 09:35:42] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/949 places, 943/944 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2936 ms. Remains : 947/949 places, 943/944 transitions.
[2023-03-23 09:35:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7331 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 974043 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
[2023-03-23 09:35:54] [INFO ] Invariant cache hit.
[2023-03-23 09:35:54] [INFO ] [Real]Absence check using 448 positive place invariants in 220 ms returned sat
[2023-03-23 09:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:35:55] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-23 09:35:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:35:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 189 ms returned sat
[2023-03-23 09:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:35:56] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-23 09:35:56] [INFO ] Computed and/alt/rep : 940/1680/940 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-23 09:36:12] [INFO ] Added : 870 causal constraints over 174 iterations in 16057 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 943/943 transitions.
Applied a total of 0 rules in 47 ms. Remains 947 /947 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 947/947 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 943/943 transitions.
Applied a total of 0 rules in 31 ms. Remains 947 /947 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2023-03-23 09:36:15] [INFO ] Invariant cache hit.
[2023-03-23 09:36:15] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-23 09:36:15] [INFO ] Invariant cache hit.
[2023-03-23 09:36:17] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-03-23 09:36:17] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-23 09:36:17] [INFO ] Invariant cache hit.
[2023-03-23 09:36:18] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3613 ms. Remains : 947/947 places, 943/943 transitions.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-02
[2023-03-23 09:36:18] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
[2023-03-23 09:36:18] [INFO ] Invariant cache hit.
[2023-03-23 09:36:19] [INFO ] [Real]Absence check using 448 positive place invariants in 63 ms returned sat
[2023-03-23 09:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:36:20] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2023-03-23 09:36:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:36:20] [INFO ] [Nat]Absence check using 448 positive place invariants in 60 ms returned sat
[2023-03-23 09:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:36:20] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-23 09:36:21] [INFO ] Computed and/alt/rep : 940/1680/940 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-23 09:36:25] [INFO ] Deduced a trap composed of 2 places in 669 ms of which 2 ms to minimize.
[2023-03-23 09:36: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: 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.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:733)
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] Max seen :[0]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 943/943 transitions.
Applied a total of 0 rules in 18 ms. Remains 947 /947 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 947/947 places, 943/943 transitions.
[2023-03-23 09:36:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7283 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 971323 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
[2023-03-23 09:36:38] [INFO ] Invariant cache hit.
[2023-03-23 09:36:38] [INFO ] [Real]Absence check using 448 positive place invariants in 71 ms returned sat
[2023-03-23 09:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 09:36:38] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-23 09:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 09:36:39] [INFO ] [Nat]Absence check using 448 positive place invariants in 74 ms returned sat
[2023-03-23 09:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 09:36:39] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-03-23 09:36:39] [INFO ] Computed and/alt/rep : 940/1680/940 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-23 09:36:58] [INFO ] Added : 870 causal constraints over 174 iterations in 19206 ms. Result :sat
Minimization took 3019 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 943/943 transitions.
Applied a total of 0 rules in 51 ms. Remains 947 /947 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 947/947 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 943/943 transitions.
Applied a total of 0 rules in 16 ms. Remains 947 /947 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2023-03-23 09:37:01] [INFO ] Invariant cache hit.
[2023-03-23 09:37:04] [INFO ] Implicit Places using invariants in 2399 ms returned []
[2023-03-23 09:37:04] [INFO ] Invariant cache hit.
[2023-03-23 09:37:06] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 4236 ms to find 0 implicit places.
[2023-03-23 09:37:06] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 09:37:06] [INFO ] Invariant cache hit.
[2023-03-23 09:37:06] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4883 ms. Remains : 947/947 places, 943/943 transitions.
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-02 in 48036 ms.
[2023-03-23 09:37:07] [INFO ] Flatten gal took : 123 ms
[2023-03-23 09:37:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 09:37:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 947 places, 943 transitions and 4689 arcs took 7 ms.
Total runtime 440635 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 050B
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 947 places, 943 transitions, 4689 arcs.
Final Score: 9529.77
Took : 37 seconds
Bounds file is: UpperBounds.xml
FORMULA ShieldIIPt-PT-050B-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1679564409035
--------------------
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:
++ 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'
++ sed s/.jar//
+ 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="ShieldIIPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldIIPt-PT-050B, 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 r395-oct2-167903718600333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B 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 '
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 ;