Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678485787039

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=FlexibleBarrier-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:03:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 22:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:03:08] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-10 22:03:08] [INFO ] Transformed 920 places.
[2023-03-10 22:03:08] [INFO ] Transformed 1057 transitions.
[2023-03-10 22:03:08] [INFO ] Found NUPN structural information;
[2023-03-10 22:03:08] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-10 22:03:09] [INFO ] Computed 10 place invariants in 42 ms
Incomplete random walk after 10000 steps, including 158 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :9
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
[2023-03-10 22:03:09] [INFO ] Invariant cache hit.
[2023-03-10 22:03:09] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-10 22:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:09] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-10 22:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-10 22:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:10] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-10 22:03:10] [INFO ] Deduced a trap composed of 298 places in 226 ms of which 4 ms to minimize.
[2023-03-10 22:03:10] [INFO ] Deduced a trap composed of 283 places in 189 ms of which 1 ms to minimize.
[2023-03-10 22:03:11] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 1 ms to minimize.
[2023-03-10 22:03:11] [INFO ] Deduced a trap composed of 84 places in 214 ms of which 1 ms to minimize.
[2023-03-10 22:03:11] [INFO ] Deduced a trap composed of 117 places in 218 ms of which 1 ms to minimize.
[2023-03-10 22:03:11] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 1 ms to minimize.
[2023-03-10 22:03:12] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2023-03-10 22:03:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1647 ms
[2023-03-10 22:03:12] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 65 ms.
[2023-03-10 22:03:15] [INFO ] Deduced a trap composed of 92 places in 290 ms of which 1 ms to minimize.
[2023-03-10 22:03:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:03:15] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-10 22:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:15] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-10 22:03:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-10 22:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:16] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-10 22:03:16] [INFO ] Deduced a trap composed of 358 places in 217 ms of which 1 ms to minimize.
[2023-03-10 22:03:16] [INFO ] Deduced a trap composed of 290 places in 194 ms of which 1 ms to minimize.
[2023-03-10 22:03:16] [INFO ] Deduced a trap composed of 317 places in 207 ms of which 1 ms to minimize.
[2023-03-10 22:03:17] [INFO ] Deduced a trap composed of 319 places in 186 ms of which 1 ms to minimize.
[2023-03-10 22:03:17] [INFO ] Deduced a trap composed of 289 places in 140 ms of which 1 ms to minimize.
[2023-03-10 22:03:17] [INFO ] Deduced a trap composed of 312 places in 188 ms of which 1 ms to minimize.
[2023-03-10 22:03:17] [INFO ] Deduced a trap composed of 284 places in 202 ms of which 0 ms to minimize.
[2023-03-10 22:03:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1648 ms
[2023-03-10 22:03:17] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 56 ms.
[2023-03-10 22:03:20] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:03:20] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-10 22:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:21] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-10 22:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-10 22:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:21] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-10 22:03:21] [INFO ] Deduced a trap composed of 359 places in 190 ms of which 1 ms to minimize.
[2023-03-10 22:03:22] [INFO ] Deduced a trap composed of 341 places in 169 ms of which 0 ms to minimize.
[2023-03-10 22:03:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2023-03-10 22:03:22] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 60 ms.
[2023-03-10 22:03:25] [INFO ] Added : 337 causal constraints over 68 iterations in 3786 ms. Result :sat
Minimization took 233 ms.
[2023-03-10 22:03:26] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-10 22:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:26] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-10 22:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-10 22:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:27] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-10 22:03:27] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 0 ms to minimize.
[2023-03-10 22:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-10 22:03:27] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 49 ms.
[2023-03-10 22:03:31] [INFO ] Deduced a trap composed of 310 places in 282 ms of which 1 ms to minimize.
[2023-03-10 22:03:31] [INFO ] Deduced a trap composed of 307 places in 271 ms of which 1 ms to minimize.
[2023-03-10 22:03:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-10 22:03:31] [INFO ] Added : 326 causal constraints over 67 iterations in 4441 ms. Result :unknown
[2023-03-10 22:03:31] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-10 22:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:32] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-10 22:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-10 22:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:32] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-10 22:03:32] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 54 ms.
[2023-03-10 22:03:36] [INFO ] Deduced a trap composed of 310 places in 205 ms of which 1 ms to minimize.
[2023-03-10 22:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-10 22:03:36] [INFO ] Added : 324 causal constraints over 65 iterations in 4025 ms. Result :sat
Minimization took 204 ms.
[2023-03-10 22:03:37] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2023-03-10 22:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:37] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-10 22:03:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:03:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-10 22:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:03:37] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-10 22:03:38] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 1 ms to minimize.
[2023-03-10 22:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-10 22:03:38] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 53 ms.
[2023-03-10 22:03:41] [INFO ] Added : 320 causal constraints over 64 iterations in 3410 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 889 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 5 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 878 transition count 767
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 639 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 638 transition count 766
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 481 place count 638 transition count 712
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 589 place count 584 transition count 712
Discarding 314 places :
Symmetric choice reduction at 3 with 314 rule applications. Total rules 903 place count 270 transition count 398
Iterating global reduction 3 with 314 rules applied. Total rules applied 1217 place count 270 transition count 398
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1217 place count 270 transition count 389
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1235 place count 261 transition count 389
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1242 place count 261 transition count 382
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 1289 place count 214 transition count 335
Iterating global reduction 4 with 47 rules applied. Total rules applied 1336 place count 214 transition count 335
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 1382 place count 214 transition count 289
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1464 place count 173 transition count 248
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1473 place count 173 transition count 239
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1481 place count 165 transition count 231
Iterating global reduction 6 with 8 rules applied. Total rules applied 1489 place count 165 transition count 231
Free-agglomeration rule applied 118 times.
Iterating global reduction 6 with 118 rules applied. Total rules applied 1607 place count 165 transition count 113
Reduce places removed 118 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 126 edges and 47 vertex of which 37 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 168 rules applied. Total rules applied 1775 place count 37 transition count 64
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1789 place count 37 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1790 place count 36 transition count 49
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 35 vertex of which 12 / 35 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 1792 place count 29 transition count 49
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1804 place count 29 transition count 37
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 1804 place count 29 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 1816 place count 23 transition count 31
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1821 place count 23 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1831 place count 18 transition count 21
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1836 place count 18 transition count 16
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1849 place count 10 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1850 place count 10 transition count 11
Applied a total of 1850 rules in 152 ms. Remains 10 /920 variables (removed 910) and now considering 11/1057 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 10/920 places, 11/1057 transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-10 22:03:42] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 4) seen :4
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34359 ms.
ITS solved all properties within timeout

BK_STOP 1678485823908

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r167-tall-167838853200485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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