fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620506200581
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudDeployment-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
496.188 60292.00 77344.00 168.80 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/mcc2024-input.r476-tall-171620506200581.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudDeployment-PT-4b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K May 18 16:42 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 CloudDeployment-PT-4b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-4b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717208530156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 02:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:22:11] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-06-01 02:22:11] [INFO ] Transformed 1182 places.
[2024-06-01 02:22:11] [INFO ] Transformed 1824 transitions.
[2024-06-01 02:22:11] [INFO ] Found NUPN structural information;
[2024-06-01 02:22:11] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1824 rows 1182 cols
[2024-06-01 02:22:11] [INFO ] Computed 17 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (77 resets) in 50 ms. (196 steps per ms)
FORMULA CloudDeployment-PT-4b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (99 resets) in 116 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 02:22:11] [INFO ] Invariant cache hit.
[2024-06-01 02:22:12] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 28 ms returned sat
[2024-06-01 02:22:12] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-06-01 02:22:13] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 156 ms.
[2024-06-01 02:22:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:13] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 25 ms returned sat
[2024-06-01 02:22:14] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-06-01 02:22:14] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 204 ms.
[2024-06-01 02:22:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:22:18] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:22:19] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-06-01 02:22:19] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 101 ms.
[2024-06-01 02:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:20] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 25 ms returned sat
[2024-06-01 02:22:20] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2024-06-01 02:22:20] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 113 ms.
[2024-06-01 02:22:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:22:25] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:22:25] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-06-01 02:22:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:25] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 25 ms returned sat
[2024-06-01 02:22:26] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-06-01 02:22:26] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 95 ms.
[2024-06-01 02:22:30] [INFO ] Added : 275 causal constraints over 55 iterations in 4316 ms. Result :unknown
[2024-06-01 02:22:30] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:22:31] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2024-06-01 02:22:31] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 106 ms.
[2024-06-01 02:22:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:32] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:22:32] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-06-01 02:22:32] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 115 ms.
[2024-06-01 02:22:36] [INFO ] Added : 252 causal constraints over 51 iterations in 4257 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 02:22:37] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:22:37] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2024-06-01 02:22:37] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 100 ms.
[2024-06-01 02:22:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:38] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:22:38] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-06-01 02:22:39] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 107 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:22:43] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:22:43] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-06-01 02:22:44] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 111 ms.
[2024-06-01 02:22:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:44] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:22:45] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2024-06-01 02:22:45] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 101 ms.
[2024-06-01 02:22:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:22:49] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:22:50] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-06-01 02:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:50] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 26 ms returned sat
[2024-06-01 02:22:50] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-06-01 02:22:51] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 95 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:22:55] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:22:55] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2024-06-01 02:22:56] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 103 ms.
[2024-06-01 02:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:56] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 26 ms returned sat
[2024-06-01 02:22:57] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-06-01 02:22:57] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 100 ms.
[2024-06-01 02:23: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: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:23:01] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 23 ms returned sat
[2024-06-01 02:23:02] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2024-06-01 02:23:02] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 96 ms.
[2024-06-01 02:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:23:02] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 24 ms returned sat
[2024-06-01 02:23:03] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-06-01 02:23:03] [INFO ] Computed and/alt/rep : 1540/4036/1540 causal constraints (skipped 283 transitions) in 101 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1187 edges and 1182 vertex of which 316 / 1182 are part of one of the 31 SCC in 6 ms
Free SCC test removed 285 places
Drop transitions (Empty/Sink Transition effects.) removed 605 transitions
Reduce isomorphic transitions removed 605 transitions.
Graph (complete) has 2375 edges and 897 vertex of which 867 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 445 rules applied. Total rules applied 447 place count 867 transition count 770
Reduce places removed 429 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 431 rules applied. Total rules applied 878 place count 438 transition count 768
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 885 place count 437 transition count 762
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 891 place count 431 transition count 762
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 891 place count 431 transition count 746
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 923 place count 415 transition count 746
Discarding 163 places :
Symmetric choice reduction at 4 with 163 rule applications. Total rules 1086 place count 252 transition count 583
Iterating global reduction 4 with 163 rules applied. Total rules applied 1249 place count 252 transition count 583
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1261 place count 252 transition count 571
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1261 place count 252 transition count 554
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1295 place count 235 transition count 554
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1297 place count 233 transition count 552
Iterating global reduction 5 with 2 rules applied. Total rules applied 1299 place count 233 transition count 552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1300 place count 232 transition count 551
Iterating global reduction 5 with 1 rules applied. Total rules applied 1301 place count 232 transition count 551
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 1421 place count 172 transition count 491
Performed 30 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1481 place count 142 transition count 619
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1491 place count 142 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 6 with 96 rules applied. Total rules applied 1587 place count 142 transition count 513
Free-agglomeration rule applied 41 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 41 rules applied. Total rules applied 1628 place count 142 transition count 460
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 666 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 129 rules applied. Total rules applied 1757 place count 100 transition count 373
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1758 place count 100 transition count 372
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1761 place count 97 transition count 357
Iterating global reduction 8 with 3 rules applied. Total rules applied 1764 place count 97 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 8 with 49 rules applied. Total rules applied 1813 place count 97 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1814 place count 96 transition count 307
Applied a total of 1814 rules in 281 ms. Remains 96 /1182 variables (removed 1086) and now considering 307/1824 (removed 1517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 96/1182 places, 307/1824 transitions.
[2024-06-01 02:23:08] [INFO ] Flow matrix only has 183 transitions (discarded 124 similar events)
// Phase 1: matrix 183 rows 96 cols
[2024-06-01 02:23:08] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CloudDeployment-PT-4b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (18507 resets) in 1569 ms. (636 steps per ms)
FORMULA CloudDeployment-PT-4b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-4b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (3216 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 59080 ms.
ITS solved all properties within timeout

BK_STOP 1717208590448

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CloudDeployment-PT-4b"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-4b, 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 r476-tall-171620506200581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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