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.r149-smll-167819435900303.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 DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r149-smll-167819435900303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 340K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678375763984

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 15:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 15:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:29:27] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-09 15:29:27] [INFO ] Transformed 1064 places.
[2023-03-09 15:29:27] [INFO ] Transformed 998 transitions.
[2023-03-09 15:29:27] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 266 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 14 ms.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 1536 ms. (steps per millisecond=6 ) properties (out of 1053) seen :44
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 2030 ms. (steps per millisecond=14 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 15:29:32] [INFO ] Invariants computation overflowed in 159 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:29:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:29:57] [INFO ] After 25212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 918 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 918 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1064 transition count 968
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1034 transition count 968
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 1034 transition count 963
Deduced a syphon composed of 5 places in 19 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 1029 transition count 963
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 18 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 999 transition count 933
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 192 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 994 transition count 933
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 994 transition count 927
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 988 transition count 927
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 988 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 987 transition count 926
Applied a total of 164 rules in 731 ms. Remains 987 /1064 variables (removed 77) and now considering 926/998 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 987/1064 places, 926/998 transitions.
Interrupted random walk after 317141 steps, including 40773 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 71794 ms. (steps per millisecond=13 ) properties seen :51
Running SMT prover for 867 properties.
// Phase 1: matrix 926 rows 987 cols
[2023-03-09 15:31:44] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-09 15:32:11] [INFO ] After 26826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 15:34:15] [INFO ] After 90751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 15:34:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 15:35:37] [INFO ] After 81770ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2023-03-09 15:35:38] [INFO ] Deduced a trap composed of 59 places in 895 ms of which 13 ms to minimize.
[2023-03-09 15:35:39] [INFO ] Deduced a trap composed of 400 places in 1050 ms of which 3 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2342 ms
[2023-03-09 15:35:43] [INFO ] Deduced a trap composed of 377 places in 960 ms of which 3 ms to minimize.
[2023-03-09 15:35:44] [INFO ] Deduced a trap composed of 299 places in 869 ms of which 3 ms to minimize.
[2023-03-09 15:35:45] [INFO ] Deduced a trap composed of 298 places in 788 ms of which 3 ms to minimize.
[2023-03-09 15:35:45] [INFO ] Deduced a trap composed of 169 places in 371 ms of which 1 ms to minimize.
[2023-03-09 15:35:46] [INFO ] Deduced a trap composed of 155 places in 791 ms of which 2 ms to minimize.
[2023-03-09 15:35:47] [INFO ] Deduced a trap composed of 157 places in 683 ms of which 2 ms to minimize.
[2023-03-09 15:35:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5337 ms
[2023-03-09 15:35:48] [INFO ] Deduced a trap composed of 217 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:35:48] [INFO ] Deduced a trap composed of 214 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:35:49] [INFO ] Deduced a trap composed of 203 places in 256 ms of which 1 ms to minimize.
[2023-03-09 15:35:49] [INFO ] Deduced a trap composed of 205 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:35:50] [INFO ] Deduced a trap composed of 193 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:35:50] [INFO ] Deduced a trap composed of 191 places in 268 ms of which 0 ms to minimize.
[2023-03-09 15:35:50] [INFO ] Deduced a trap composed of 215 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:35:51] [INFO ] Deduced a trap composed of 181 places in 336 ms of which 1 ms to minimize.
[2023-03-09 15:35:51] [INFO ] Deduced a trap composed of 182 places in 311 ms of which 1 ms to minimize.
[2023-03-09 15:35:52] [INFO ] Deduced a trap composed of 199 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:35:52] [INFO ] Deduced a trap composed of 145 places in 383 ms of which 1 ms to minimize.
[2023-03-09 15:35:53] [INFO ] Deduced a trap composed of 143 places in 365 ms of which 2 ms to minimize.
[2023-03-09 15:35:53] [INFO ] Deduced a trap composed of 119 places in 422 ms of which 2 ms to minimize.
[2023-03-09 15:35:54] [INFO ] Deduced a trap composed of 121 places in 445 ms of which 2 ms to minimize.
[2023-03-09 15:35:55] [INFO ] Deduced a trap composed of 107 places in 468 ms of which 1 ms to minimize.
[2023-03-09 15:35:55] [INFO ] Deduced a trap composed of 109 places in 497 ms of which 1 ms to minimize.
[2023-03-09 15:35:56] [INFO ] Deduced a trap composed of 185 places in 413 ms of which 1 ms to minimize.
[2023-03-09 15:35:56] [INFO ] Deduced a trap composed of 133 places in 429 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:35:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:35:56] [INFO ] After 225334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 829 different solutions.
Parikh walk visited 0 properties in 30017 ms.
Support contains 867 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 926/926 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 987 transition count 915
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 976 transition count 915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 976 transition count 913
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 974 transition count 913
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 965 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 963 transition count 904
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 963 transition count 900
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 959 transition count 900
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 959 transition count 900
Applied a total of 60 rules in 201 ms. Remains 959 /987 variables (removed 28) and now considering 900/926 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 959/987 places, 900/926 transitions.
Interrupted random walk after 300602 steps, including 38598 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 63180 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 15:38:03] [INFO ] Invariants computation overflowed in 166 ms
[2023-03-09 15:38:38] [INFO ] After 34442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 15:41:01] [INFO ] After 98200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 15:41:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:42:17] [INFO ] After 75633ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 15:42:17] [INFO ] Deduced a trap composed of 383 places in 536 ms of which 1 ms to minimize.
[2023-03-09 15:42:18] [INFO ] Deduced a trap composed of 406 places in 683 ms of which 1 ms to minimize.
[2023-03-09 15:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1470 ms
[2023-03-09 15:42:21] [INFO ] Deduced a trap composed of 382 places in 620 ms of which 1 ms to minimize.
[2023-03-09 15:42:21] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 0 ms to minimize.
[2023-03-09 15:42:21] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:42:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1362 ms
[2023-03-09 15:42:22] [INFO ] Deduced a trap composed of 177 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:42:22] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 0 ms to minimize.
[2023-03-09 15:42:22] [INFO ] Deduced a trap composed of 195 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:42:22] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 7 ms to minimize.
[2023-03-09 15:42:23] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-09 15:42:23] [INFO ] Deduced a trap composed of 146 places in 216 ms of which 0 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:42:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:42:23] [INFO ] After 225124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 828 different solutions.
Parikh walk visited 0 properties in 30003 ms.
Support contains 867 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 34 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 959/959 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 32 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 15:42:53] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-09 15:42:53] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 15:42:54] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-09 15:42:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:43:03] [INFO ] Implicit Places using invariants and state equation in 9162 ms returned [412, 780]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9562 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 957/959 places, 900/900 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 957 transition count 900
Applied a total of 2 rules in 90 ms. Remains 957 /957 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 957 cols
[2023-03-09 15:43:03] [INFO ] Computed 102 place invariants in 212 ms
[2023-03-09 15:43:03] [INFO ] Implicit Places using invariants in 600 ms returned [85, 91, 287, 904]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 612 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 953/959 places, 900/900 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 953 transition count 897
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 950 transition count 897
Applied a total of 6 rules in 61 ms. Remains 950 /953 variables (removed 3) and now considering 897/900 (removed 3) transitions.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:43:03] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 15:43:04] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:43:04] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 15:43:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:43:28] [INFO ] Implicit Places using invariants and state equation in 24066 ms returned []
Implicit Place search using SMT with State Equation took 24362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 950/959 places, 897/900 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 34723 ms. Remains : 950/959 places, 897/900 transitions.
Interrupted random walk after 252223 steps, including 36272 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 107 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 66783 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:45:08] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-09 15:45:46] [INFO ] After 37755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 15:48:00] [INFO ] After 85432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2023-03-09 15:48:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:49:17] [INFO ] After 77012ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2023-03-09 15:49:19] [INFO ] Deduced a trap composed of 268 places in 598 ms of which 2 ms to minimize.
[2023-03-09 15:49:20] [INFO ] Deduced a trap composed of 329 places in 564 ms of which 1 ms to minimize.
[2023-03-09 15:49:20] [INFO ] Deduced a trap composed of 400 places in 521 ms of which 2 ms to minimize.
[2023-03-09 15:49:21] [INFO ] Deduced a trap composed of 390 places in 522 ms of which 1 ms to minimize.
[2023-03-09 15:49:22] [INFO ] Deduced a trap composed of 389 places in 528 ms of which 1 ms to minimize.
[2023-03-09 15:49:22] [INFO ] Deduced a trap composed of 377 places in 512 ms of which 1 ms to minimize.
[2023-03-09 15:49:23] [INFO ] Deduced a trap composed of 370 places in 611 ms of which 2 ms to minimize.
[2023-03-09 15:49:23] [INFO ] Deduced a trap composed of 402 places in 536 ms of which 1 ms to minimize.
[2023-03-09 15:49:24] [INFO ] Deduced a trap composed of 385 places in 521 ms of which 1 ms to minimize.
[2023-03-09 15:49:25] [INFO ] Deduced a trap composed of 414 places in 542 ms of which 1 ms to minimize.
[2023-03-09 15:49:25] [INFO ] Deduced a trap composed of 392 places in 534 ms of which 1 ms to minimize.
[2023-03-09 15:49:26] [INFO ] Deduced a trap composed of 382 places in 536 ms of which 1 ms to minimize.
[2023-03-09 15:49:26] [INFO ] Deduced a trap composed of 374 places in 512 ms of which 1 ms to minimize.
[2023-03-09 15:49:27] [INFO ] Deduced a trap composed of 328 places in 515 ms of which 2 ms to minimize.
[2023-03-09 15:49:27] [INFO ] Deduced a trap composed of 369 places in 532 ms of which 1 ms to minimize.
[2023-03-09 15:49:28] [INFO ] Deduced a trap composed of 372 places in 524 ms of which 1 ms to minimize.
[2023-03-09 15:49:29] [INFO ] Deduced a trap composed of 98 places in 576 ms of which 1 ms to minimize.
[2023-03-09 15:49:29] [INFO ] Deduced a trap composed of 382 places in 582 ms of which 1 ms to minimize.
[2023-03-09 15:49:30] [INFO ] Deduced a trap composed of 62 places in 517 ms of which 12 ms to minimize.
[2023-03-09 15:49:30] [INFO ] Deduced a trap composed of 386 places in 508 ms of which 1 ms to minimize.
[2023-03-09 15:49:31] [INFO ] Deduced a trap composed of 88 places in 516 ms of which 1 ms to minimize.
[2023-03-09 15:49:31] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 12487 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:49:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:49:31] [INFO ] After 225029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 825 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 25 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 24 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:50:01] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 15:50:02] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:50:02] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-09 15:50:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:50:25] [INFO ] Implicit Places using invariants and state equation in 23915 ms returned []
Implicit Place search using SMT with State Equation took 24375 ms to find 0 implicit places.
[2023-03-09 15:50:26] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:50:26] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-09 15:50:26] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25285 ms. Remains : 950/950 places, 897/897 transitions.
Incomplete random walk after 100000 steps, including 14427 resets, run finished after 10231 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:50:37] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 15:51:23] [INFO ] After 44924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-09 15:51:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:51:37] [INFO ] After 13912ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-09 15:51:37] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 2 ms to minimize.
[2023-03-09 15:51:38] [INFO ] Deduced a trap composed of 34 places in 565 ms of which 1 ms to minimize.
[2023-03-09 15:51:38] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 1 ms to minimize.
[2023-03-09 15:51:38] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:51:39] [INFO ] Deduced a trap composed of 195 places in 255 ms of which 1 ms to minimize.
[2023-03-09 15:51:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2111 ms
[2023-03-09 15:51:41] [INFO ] Deduced a trap composed of 352 places in 561 ms of which 10 ms to minimize.
[2023-03-09 15:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-09 15:51:45] [INFO ] Deduced a trap composed of 378 places in 537 ms of which 2 ms to minimize.
[2023-03-09 15:51:45] [INFO ] Deduced a trap composed of 405 places in 535 ms of which 3 ms to minimize.
[2023-03-09 15:51:46] [INFO ] Deduced a trap composed of 399 places in 545 ms of which 1 ms to minimize.
[2023-03-09 15:51:47] [INFO ] Deduced a trap composed of 422 places in 545 ms of which 2 ms to minimize.
[2023-03-09 15:51:47] [INFO ] Deduced a trap composed of 237 places in 551 ms of which 12 ms to minimize.
[2023-03-09 15:51:48] [INFO ] Deduced a trap composed of 422 places in 539 ms of which 2 ms to minimize.
[2023-03-09 15:51:48] [INFO ] Deduced a trap composed of 252 places in 532 ms of which 1 ms to minimize.
[2023-03-09 15:51:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4307 ms
[2023-03-09 15:51:55] [INFO ] Deduced a trap composed of 321 places in 558 ms of which 2 ms to minimize.
[2023-03-09 15:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 662 ms
[2023-03-09 15:51:56] [INFO ] Deduced a trap composed of 326 places in 543 ms of which 1 ms to minimize.
[2023-03-09 15:51:57] [INFO ] Deduced a trap composed of 361 places in 555 ms of which 2 ms to minimize.
[2023-03-09 15:51:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1306 ms
[2023-03-09 15:52:00] [INFO ] Deduced a trap composed of 34 places in 624 ms of which 2 ms to minimize.
[2023-03-09 15:52:00] [INFO ] Deduced a trap composed of 40 places in 828 ms of which 2 ms to minimize.
[2023-03-09 15:52:01] [INFO ] Deduced a trap composed of 27 places in 861 ms of which 1 ms to minimize.
[2023-03-09 15:52:02] [INFO ] Deduced a trap composed of 38 places in 631 ms of which 2 ms to minimize.
[2023-03-09 15:52:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3295 ms
[2023-03-09 15:52:06] [INFO ] Deduced a trap composed of 28 places in 887 ms of which 1 ms to minimize.
[2023-03-09 15:52:07] [INFO ] Deduced a trap composed of 362 places in 873 ms of which 2 ms to minimize.
[2023-03-09 15:52:07] [INFO ] Deduced a trap composed of 346 places in 887 ms of which 1 ms to minimize.
[2023-03-09 15:52:08] [INFO ] Deduced a trap composed of 346 places in 678 ms of which 3 ms to minimize.
[2023-03-09 15:52:09] [INFO ] Deduced a trap composed of 362 places in 906 ms of which 2 ms to minimize.
[2023-03-09 15:52:10] [INFO ] Deduced a trap composed of 358 places in 762 ms of which 1 ms to minimize.
[2023-03-09 15:52:11] [INFO ] Deduced a trap composed of 358 places in 740 ms of which 1 ms to minimize.
[2023-03-09 15:52:12] [INFO ] Deduced a trap composed of 387 places in 538 ms of which 1 ms to minimize.
[2023-03-09 15:52:13] [INFO ] Deduced a trap composed of 360 places in 704 ms of which 1 ms to minimize.
[2023-03-09 15:52:13] [INFO ] Deduced a trap composed of 367 places in 689 ms of which 1 ms to minimize.
[2023-03-09 15:52:14] [INFO ] Deduced a trap composed of 369 places in 893 ms of which 1 ms to minimize.
[2023-03-09 15:52:15] [INFO ] Deduced a trap composed of 334 places in 876 ms of which 1 ms to minimize.
[2023-03-09 15:52:16] [INFO ] Deduced a trap composed of 376 places in 899 ms of which 2 ms to minimize.
[2023-03-09 15:52:17] [INFO ] Deduced a trap composed of 374 places in 836 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:52:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:52:17] [INFO ] After 100345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 291697 steps, including 42149 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500249 distinct states, run finished after 61054 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:53:52] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 15:54:22] [INFO ] After 30156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 15:56:20] [INFO ] After 73567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2023-03-09 15:56:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:57:43] [INFO ] After 82732ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2023-03-09 15:57:46] [INFO ] Deduced a trap composed of 268 places in 835 ms of which 2 ms to minimize.
[2023-03-09 15:57:47] [INFO ] Deduced a trap composed of 329 places in 773 ms of which 1 ms to minimize.
[2023-03-09 15:57:48] [INFO ] Deduced a trap composed of 400 places in 765 ms of which 1 ms to minimize.
[2023-03-09 15:57:48] [INFO ] Deduced a trap composed of 390 places in 737 ms of which 2 ms to minimize.
[2023-03-09 15:57:49] [INFO ] Deduced a trap composed of 389 places in 780 ms of which 2 ms to minimize.
[2023-03-09 15:57:50] [INFO ] Deduced a trap composed of 377 places in 800 ms of which 1 ms to minimize.
[2023-03-09 15:57:51] [INFO ] Deduced a trap composed of 370 places in 663 ms of which 1 ms to minimize.
[2023-03-09 15:57:52] [INFO ] Deduced a trap composed of 402 places in 732 ms of which 1 ms to minimize.
[2023-03-09 15:57:52] [INFO ] Deduced a trap composed of 385 places in 554 ms of which 2 ms to minimize.
[2023-03-09 15:57:53] [INFO ] Deduced a trap composed of 414 places in 831 ms of which 2 ms to minimize.
[2023-03-09 15:57:54] [INFO ] Deduced a trap composed of 392 places in 791 ms of which 1 ms to minimize.
[2023-03-09 15:57:55] [INFO ] Deduced a trap composed of 382 places in 574 ms of which 2 ms to minimize.
[2023-03-09 15:57:55] [INFO ] Deduced a trap composed of 374 places in 804 ms of which 2 ms to minimize.
[2023-03-09 15:57:56] [INFO ] Deduced a trap composed of 328 places in 811 ms of which 2 ms to minimize.
[2023-03-09 15:57:57] [INFO ] Deduced a trap composed of 369 places in 797 ms of which 2 ms to minimize.
[2023-03-09 15:57:58] [INFO ] Deduced a trap composed of 372 places in 844 ms of which 2 ms to minimize.
[2023-03-09 15:57:59] [INFO ] Deduced a trap composed of 98 places in 833 ms of which 1 ms to minimize.
[2023-03-09 15:58:00] [INFO ] Deduced a trap composed of 382 places in 746 ms of which 2 ms to minimize.
[2023-03-09 15:58:01] [INFO ] Deduced a trap composed of 62 places in 838 ms of which 2 ms to minimize.
[2023-03-09 15:58:02] [INFO ] Deduced a trap composed of 386 places in 736 ms of which 1 ms to minimize.
[2023-03-09 15:58:03] [INFO ] Deduced a trap composed of 88 places in 836 ms of which 2 ms to minimize.
[2023-03-09 15:58:03] [INFO ] Deduced a trap composed of 406 places in 790 ms of which 2 ms to minimize.
[2023-03-09 15:58:04] [INFO ] Deduced a trap composed of 394 places in 845 ms of which 2 ms to minimize.
[2023-03-09 15:58:05] [INFO ] Deduced a trap composed of 309 places in 733 ms of which 2 ms to minimize.
[2023-03-09 15:58:06] [INFO ] Deduced a trap composed of 86 places in 658 ms of which 2 ms to minimize.
[2023-03-09 15:58:07] [INFO ] Deduced a trap composed of 386 places in 825 ms of which 1 ms to minimize.
[2023-03-09 15:58:08] [INFO ] Deduced a trap composed of 3 places in 930 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-09 15:58:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:58:08] [INFO ] After 225955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 825 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 867 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 26 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 950/950 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 897/897 transitions.
Applied a total of 0 rules in 24 ms. Remains 950 /950 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:58:38] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-09 15:58:38] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:58:38] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-09 15:58:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:58:39] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2023-03-09 15:58:39] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:58:39] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-09 15:58:40] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1993 ms. Remains : 950/950 places, 897/897 transitions.
Incomplete random walk after 100000 steps, including 14331 resets, run finished after 10057 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 897 rows 950 cols
[2023-03-09 15:58:50] [INFO ] Invariants computation overflowed in 62 ms
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15453452 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16169684 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 StableMarking -timeout 180 -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="DoubleExponent-PT-020"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DoubleExponent-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r149-smll-167819435900303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;