fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r423-tajo-167905976900533
Last Updated
May 14, 2023

About the Execution of LoLa+red for SimpleLoadBal-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
536.455 51640.00 65975.00 63.30 1 1 1 1 1 1 1 1 0 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 '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976900533.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SimpleLoadBal-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976900533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 03:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 SimpleLoadBal-PT-20-UpperBounds-00
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-01
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-02
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-03
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-04
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-05
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-06
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-07
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-08
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-09
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-10
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-11
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-12
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-13
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-14
FORMULA_NAME SimpleLoadBal-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679250919288

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 18:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 18:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:35:20] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-19 18:35:20] [INFO ] Transformed 194 places.
[2023-03-19 18:35:20] [INFO ] Transformed 2205 transitions.
[2023-03-19 18:35:20] [INFO ] Found NUPN structural information;
[2023-03-19 18:35:20] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_idle_16, P_client_idle_17, P_client_idle_18, P_client_idle_19, P_client_idle_20, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_waiting_16, P_client_waiting_17, P_client_waiting_18, P_client_waiting_19, P_client_waiting_20, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_request_16, P_client_request_17, P_client_request_18, P_client_request_19, P_client_request_20, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_client_ack_16, P_client_ack_17, P_client_ack_18, P_client_ack_19, P_client_ack_20, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_server_request_16_1, P_server_request_16_2, P_server_request_17_1, P_server_request_17_2, P_server_request_18_1, P_server_request_18_2, P_server_request_19_1, P_server_request_19_2, P_server_request_20_1, P_server_request_20_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_routing_1_16, P_lb_routing_1_17, P_lb_routing_1_18, P_lb_routing_1_19, P_lb_routing_1_20, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_1_16, P_lb_load_1_17, P_lb_load_1_18, P_lb_load_1_19, P_lb_load_1_20, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15, P_lb_load_2_16, P_lb_load_2_17, P_lb_load_2_18, P_lb_load_2_19, P_lb_load_2_20]
[2023-03-19 18:35:20] [INFO ] Parsed PT model containing 194 places and 2205 transitions and 15678 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 1745 out of 2205 initially.
// Phase 1: matrix 1745 rows 194 cols
[2023-03-19 18:35:20] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 16) seen :15
FORMULA SimpleLoadBal-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-19 18:35:21] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-19 18:35:21] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-19 18:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:35:21] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-19 18:35:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:35:22] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-03-19 18:35:22] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-19 18:35:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 18:35:26] [INFO ] [Nat]Added 820 Read/Feed constraints in 4287 ms returned sat
[2023-03-19 18:35:27] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 4 ms to minimize.
[2023-03-19 18:35:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 194 places. Attempting structural reductions.
Drop transitions removed 105 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 2100/2100 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 196 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 187 transition count 1902
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 69 place count 147 transition count 1882
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 12 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 109 place count 127 transition count 1862
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 129 place count 127 transition count 1842
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 149 place count 107 transition count 1842
Applied a total of 149 rules in 493 ms. Remains 107 /194 variables (removed 87) and now considering 1842/2100 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 107/194 places, 1842/2100 transitions.
Normalized transition count is 1451 out of 1842 initially.
// Phase 1: matrix 1451 rows 107 cols
[2023-03-19 18:35:27] [INFO ] Invariants computation overflowed in 16 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10729 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1882 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
[2023-03-19 18:35:40] [INFO ] Flow matrix only has 1451 transitions (discarded 391 similar events)
// Phase 1: matrix 1451 rows 107 cols
[2023-03-19 18:35:40] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-19 18:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:35:40] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-19 18:35:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:35:40] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-19 18:35:40] [INFO ] State equation strengthened by 714 read => feed constraints.
[2023-03-19 18:35:41] [INFO ] [Nat]Added 714 Read/Feed constraints in 193 ms returned sat
[2023-03-19 18:35:41] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2023-03-19 18:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-19 18:35:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1431 transitions) in 285 ms.
[2023-03-19 18:35:41] [INFO ] Added : 0 causal constraints over 0 iterations in 443 ms. Result :sat
Minimization took 369 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 1842/1842 transitions.
Applied a total of 0 rules in 166 ms. Remains 107 /107 variables (removed 0) and now considering 1842/1842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 107/107 places, 1842/1842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 1842/1842 transitions.
Applied a total of 0 rules in 142 ms. Remains 107 /107 variables (removed 0) and now considering 1842/1842 (removed 0) transitions.
[2023-03-19 18:35:43] [INFO ] Flow matrix only has 1451 transitions (discarded 391 similar events)
// Phase 1: matrix 1451 rows 107 cols
[2023-03-19 18:35:43] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-19 18:35:43] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 18:35:43] [INFO ] Flow matrix only has 1451 transitions (discarded 391 similar events)
// Phase 1: matrix 1451 rows 107 cols
[2023-03-19 18:35:43] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-19 18:35:43] [INFO ] State equation strengthened by 714 read => feed constraints.
[2023-03-19 18:35:46] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2792 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/107 places, 1842/1842 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 1840
Applied a total of 4 rules in 209 ms. Remains 103 /105 variables (removed 2) and now considering 1840/1842 (removed 2) transitions.
[2023-03-19 18:35:46] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
// Phase 1: matrix 1449 rows 103 cols
[2023-03-19 18:35:46] [INFO ] Computed 27 place invariants in 19 ms
[2023-03-19 18:35:46] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-19 18:35:46] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
[2023-03-19 18:35:46] [INFO ] Invariant cache hit.
[2023-03-19 18:35:47] [INFO ] State equation strengthened by 714 read => feed constraints.
[2023-03-19 18:35:48] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/107 places, 1840/1842 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5398 ms. Remains : 103/107 places, 1840/1842 transitions.
Normalized transition count is 1449 out of 1840 initially.
// Phase 1: matrix 1449 rows 103 cols
[2023-03-19 18:35:48] [INFO ] Computed 27 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12811 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1892 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
[2023-03-19 18:36:03] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
// Phase 1: matrix 1449 rows 103 cols
[2023-03-19 18:36:03] [INFO ] Computed 27 place invariants in 28 ms
[2023-03-19 18:36:03] [INFO ] [Real]Absence check using 24 positive place invariants in 8 ms returned sat
[2023-03-19 18:36:03] [INFO ] [Real]Absence check using 24 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 18:36:03] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-19 18:36:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 18:36:03] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-19 18:36:03] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 18:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 18:36:04] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-19 18:36:04] [INFO ] State equation strengthened by 714 read => feed constraints.
[2023-03-19 18:36:05] [INFO ] [Nat]Added 714 Read/Feed constraints in 1063 ms returned sat
[2023-03-19 18:36:05] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 2 ms to minimize.
[2023-03-19 18:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-19 18:36:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1429 transitions) in 635 ms.
[2023-03-19 18:36:06] [INFO ] Added : 0 causal constraints over 0 iterations in 804 ms. Result :sat
Minimization took 474 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 1840/1840 transitions.
Applied a total of 0 rules in 193 ms. Remains 103 /103 variables (removed 0) and now considering 1840/1840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 103/103 places, 1840/1840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 1840/1840 transitions.
Applied a total of 0 rules in 191 ms. Remains 103 /103 variables (removed 0) and now considering 1840/1840 (removed 0) transitions.
[2023-03-19 18:36:07] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
[2023-03-19 18:36:07] [INFO ] Invariant cache hit.
[2023-03-19 18:36:07] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 18:36:07] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
[2023-03-19 18:36:07] [INFO ] Invariant cache hit.
[2023-03-19 18:36:08] [INFO ] State equation strengthened by 714 read => feed constraints.
[2023-03-19 18:36:09] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
[2023-03-19 18:36:09] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-19 18:36:09] [INFO ] Flow matrix only has 1449 transitions (discarded 391 similar events)
[2023-03-19 18:36:09] [INFO ] Invariant cache hit.
[2023-03-19 18:36:10] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 598 transitions.
Found 598 dead transitions using SMT.
Drop transitions removed 598 transitions
Dead transitions reduction (with SMT) removed 598 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 1242/1840 transitions.
Graph (complete) has 2910 edges and 103 vertex of which 1 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.2 ms
Discarding 102 places :
Also discarding 1242 output transitions
Drop transitions removed 1242 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 1 /103 variables (removed 102) and now considering 0/1242 (removed 1242) transitions.
[2023-03-19 18:36:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 18:36:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 18:36:10] [INFO ] Invariant cache hit.
[2023-03-19 18:36:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/103 places, 0/1840 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3559 ms. Remains : 1/103 places, 0/1840 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-20-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 50027 ms.
ITS solved all properties within timeout

BK_STOP 1679250970928

--------------------
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.202303021504.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="SimpleLoadBal-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SimpleLoadBal-PT-20, 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 r423-tajo-167905976900533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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