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.r152-smll-167819439200303.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 marciexred
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 r152-smll-167819439200303
=====================================================================

--------------------
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 1678400722926

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=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 22:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 22:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:25:26] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-09 22:25:26] [INFO ] Transformed 1064 places.
[2023-03-09 22:25:26] [INFO ] Transformed 998 transitions.
[2023-03-09 22:25:26] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 254 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 14 ms.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 1407 ms. (steps per millisecond=7 ) properties (out of 1053) seen :44
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 2087 ms. (steps per millisecond=14 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 22:25:30] [INFO ] Invariants computation overflowed in 251 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 22:25:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:25:56] [INFO ] After 25134ms 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 34 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 90 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 88 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 675 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 677 ms. Remains : 987/1064 places, 926/998 transitions.
Interrupted random walk after 320951 steps, including 41170 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 65 ms. (steps per millisecond=15 ) 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 64 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 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 86 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 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 88 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 74 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 69 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 63 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 61308 ms. (steps per millisecond=16 ) properties seen :51
Running SMT prover for 867 properties.
// Phase 1: matrix 926 rows 987 cols
[2023-03-09 22:27:31] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 22:27:55] [INFO ] After 23927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 22:30:02] [INFO ] After 96017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 22:30:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 22:31:25] [INFO ] After 82409ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2023-03-09 22:31:26] [INFO ] Deduced a trap composed of 59 places in 1060 ms of which 23 ms to minimize.
[2023-03-09 22:31:27] [INFO ] Deduced a trap composed of 400 places in 924 ms of which 4 ms to minimize.
[2023-03-09 22:31:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2383 ms
[2023-03-09 22:31:30] [INFO ] Deduced a trap composed of 377 places in 689 ms of which 1 ms to minimize.
[2023-03-09 22:31:31] [INFO ] Deduced a trap composed of 299 places in 558 ms of which 3 ms to minimize.
[2023-03-09 22:31:32] [INFO ] Deduced a trap composed of 298 places in 745 ms of which 2 ms to minimize.
[2023-03-09 22:31:32] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 2 ms to minimize.
[2023-03-09 22:31:33] [INFO ] Deduced a trap composed of 155 places in 863 ms of which 2 ms to minimize.
[2023-03-09 22:31:34] [INFO ] Deduced a trap composed of 157 places in 708 ms of which 2 ms to minimize.
[2023-03-09 22:31:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4436 ms
[2023-03-09 22:31:34] [INFO ] Deduced a trap composed of 217 places in 180 ms of which 0 ms to minimize.
[2023-03-09 22:31:35] [INFO ] Deduced a trap composed of 214 places in 228 ms of which 1 ms to minimize.
[2023-03-09 22:31:35] [INFO ] Deduced a trap composed of 203 places in 222 ms of which 1 ms to minimize.
[2023-03-09 22:31:35] [INFO ] Deduced a trap composed of 205 places in 270 ms of which 1 ms to minimize.
[2023-03-09 22:31:36] [INFO ] Deduced a trap composed of 193 places in 297 ms of which 1 ms to minimize.
[2023-03-09 22:31:36] [INFO ] Deduced a trap composed of 191 places in 276 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 215 places in 312 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 181 places in 309 ms of which 1 ms to minimize.
[2023-03-09 22:31:37] [INFO ] Deduced a trap composed of 182 places in 305 ms of which 0 ms to minimize.
[2023-03-09 22:31:38] [INFO ] Deduced a trap composed of 199 places in 275 ms of which 1 ms to minimize.
[2023-03-09 22:31:38] [INFO ] Deduced a trap composed of 145 places in 337 ms of which 1 ms to minimize.
[2023-03-09 22:31:39] [INFO ] Deduced a trap composed of 143 places in 290 ms of which 1 ms to minimize.
[2023-03-09 22:31:39] [INFO ] Deduced a trap composed of 119 places in 354 ms of which 2 ms to minimize.
[2023-03-09 22:31:40] [INFO ] Deduced a trap composed of 121 places in 449 ms of which 1 ms to minimize.
[2023-03-09 22:31:40] [INFO ] Deduced a trap composed of 107 places in 461 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 22:31:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:31:40] [INFO ] After 225404ms 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 30026 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 16 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 17 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 210 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 212 ms. Remains : 959/987 places, 900/926 transitions.
Interrupted random walk after 330427 steps, including 42330 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 76 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 86 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 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 79 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 82 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 85 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 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 83 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 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 84 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 88 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 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 87 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 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 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 79 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 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 61 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 93 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 84 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 91 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 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 92 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 85 resets, run finished after 60 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 61 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 61 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 85 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 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 77 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 87 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 88 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 81 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 84 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 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 83 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 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 82 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 84 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 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 90 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 89 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 84 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 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 83 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 88 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 83 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 58738 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:33:43] [INFO ] Invariants computation overflowed in 165 ms
[2023-03-09 22:34:12] [INFO ] After 28922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 22:36:19] [INFO ] After 97145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 22:36:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:37:33] [INFO ] After 73978ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 22:37:34] [INFO ] Deduced a trap composed of 383 places in 565 ms of which 2 ms to minimize.
[2023-03-09 22:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2023-03-09 22:37:34] [INFO ] Deduced a trap composed of 244 places in 572 ms of which 2 ms to minimize.
[2023-03-09 22:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 721 ms
[2023-03-09 22:37:35] [INFO ] Deduced a trap composed of 182 places in 197 ms of which 1 ms to minimize.
[2023-03-09 22:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-09 22:37:36] [INFO ] Deduced a trap composed of 378 places in 586 ms of which 1 ms to minimize.
[2023-03-09 22:37:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 744 ms
[2023-03-09 22:37:40] [INFO ] Deduced a trap composed of 228 places in 437 ms of which 1 ms to minimize.
[2023-03-09 22:37:40] [INFO ] Deduced a trap composed of 196 places in 178 ms of which 1 ms to minimize.
[2023-03-09 22:37:40] [INFO ] Deduced a trap composed of 205 places in 161 ms of which 1 ms to minimize.
[2023-03-09 22:37:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1093 ms
[2023-03-09 22:37:41] [INFO ] Deduced a trap composed of 184 places in 179 ms of which 0 ms to minimize.
[2023-03-09 22:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-09 22:37:42] [INFO ] Deduced a trap composed of 207 places in 160 ms of which 0 ms to minimize.
[2023-03-09 22:37:43] [INFO ] Deduced a trap composed of 172 places in 187 ms of which 1 ms to minimize.
[2023-03-09 22:37:43] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 2 ms to minimize.
[2023-03-09 22:37:44] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-09 22:37:44] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-09 22:37:45] [INFO ] Deduced a trap composed of 148 places in 223 ms of which 1 ms to minimize.
[2023-03-09 22:37:45] [INFO ] Deduced a trap composed of 189 places in 209 ms of which 2 ms to minimize.
[2023-03-09 22:37:45] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 1 ms to minimize.
[2023-03-09 22:37:46] [INFO ] Deduced a trap composed of 134 places in 225 ms of which 2 ms to minimize.
[2023-03-09 22:37:46] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 1 ms to minimize.
[2023-03-09 22:37:46] [INFO ] Deduced a trap composed of 129 places in 279 ms of which 1 ms to minimize.
[2023-03-09 22:37:47] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 1 ms to minimize.
[2023-03-09 22:37:47] [INFO ] Deduced a trap composed of 112 places in 277 ms of which 1 ms to minimize.
[2023-03-09 22:37:47] [INFO ] Deduced a trap composed of 237 places in 278 ms of which 1 ms to minimize.
[2023-03-09 22:37:48] [INFO ] Deduced a trap composed of 251 places in 362 ms of which 2 ms to minimize.
[2023-03-09 22:37:48] [INFO ] Deduced a trap composed of 168 places in 482 ms of which 2 ms to minimize.
[2023-03-09 22:37:49] [INFO ] Deduced a trap composed of 86 places in 468 ms of which 1 ms to minimize.
[2023-03-09 22:37:49] [INFO ] Deduced a trap composed of 74 places in 497 ms of which 1 ms to minimize.
[2023-03-09 22:37:50] [INFO ] Deduced a trap composed of 262 places in 551 ms of which 2 ms to minimize.
[2023-03-09 22:37:51] [INFO ] Deduced a trap composed of 204 places in 560 ms of which 3 ms to minimize.
[2023-03-09 22:37:51] [INFO ] Deduced a trap composed of 206 places in 572 ms of which 1 ms to minimize.
[2023-03-09 22:37:52] [INFO ] Deduced a trap composed of 50 places in 554 ms of which 2 ms to minimize.
[2023-03-09 22:37:53] [INFO ] Deduced a trap composed of 64 places in 551 ms of which 1 ms to minimize.
[2023-03-09 22:37:53] [INFO ] Deduced a trap composed of 62 places in 544 ms of which 2 ms to minimize.
[2023-03-09 22:37:54] [INFO ] Deduced a trap composed of 221 places in 512 ms of which 1 ms to minimize.
[2023-03-09 22:37:55] [INFO ] Deduced a trap composed of 254 places in 532 ms of which 2 ms to minimize.
[2023-03-09 22:37:55] [INFO ] Deduced a trap composed of 213 places in 523 ms of which 1 ms to minimize.
[2023-03-09 22:37:56] [INFO ] Deduced a trap composed of 100 places in 451 ms of which 1 ms to minimize.
[2023-03-09 22:37:57] [INFO ] Deduced a trap composed of 255 places in 428 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 22:37:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:37:57] [INFO ] After 225458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 819 different solutions.
Parikh walk visited 0 properties in 30009 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 32 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 32 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 22:38:27] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-09 22:38:28] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:38:28] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-09 22:38:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:38:29] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-09 22:38:29] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:38:29] [INFO ] Invariants computation overflowed in 226 ms
[2023-03-09 22:38:30] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2779 ms. Remains : 959/959 places, 900/900 transitions.
Incomplete random walk after 100000 steps, including 12935 resets, run finished after 9464 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:38:40] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-09 22:39:33] [INFO ] After 52195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-09 22:39:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:39:49] [INFO ] After 15395ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-09 22:39:49] [INFO ] Deduced a trap composed of 11 places in 584 ms of which 2 ms to minimize.
[2023-03-09 22:39:50] [INFO ] Deduced a trap composed of 150 places in 386 ms of which 1 ms to minimize.
[2023-03-09 22:39:50] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 1 ms to minimize.
[2023-03-09 22:39:50] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 2 ms to minimize.
[2023-03-09 22:39:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1948 ms
[2023-03-09 22:39:53] [INFO ] Deduced a trap composed of 350 places in 636 ms of which 2 ms to minimize.
[2023-03-09 22:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 868 ms
[2023-03-09 22:39:54] [INFO ] Deduced a trap composed of 409 places in 795 ms of which 2 ms to minimize.
[2023-03-09 22:39:55] [INFO ] Deduced a trap composed of 352 places in 702 ms of which 1 ms to minimize.
[2023-03-09 22:39:56] [INFO ] Deduced a trap composed of 256 places in 620 ms of which 3 ms to minimize.
[2023-03-09 22:39:57] [INFO ] Deduced a trap composed of 312 places in 714 ms of which 1 ms to minimize.
[2023-03-09 22:39:57] [INFO ] Deduced a trap composed of 282 places in 555 ms of which 1 ms to minimize.
[2023-03-09 22:39:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3906 ms
[2023-03-09 22:39:58] [INFO ] Deduced a trap composed of 383 places in 795 ms of which 2 ms to minimize.
[2023-03-09 22:39:59] [INFO ] Deduced a trap composed of 376 places in 797 ms of which 1 ms to minimize.
[2023-03-09 22:40:00] [INFO ] Deduced a trap composed of 395 places in 589 ms of which 1 ms to minimize.
[2023-03-09 22:40:01] [INFO ] Deduced a trap composed of 383 places in 682 ms of which 2 ms to minimize.
[2023-03-09 22:40:02] [INFO ] Deduced a trap composed of 207 places in 799 ms of which 2 ms to minimize.
[2023-03-09 22:40:03] [INFO ] Deduced a trap composed of 395 places in 825 ms of which 2 ms to minimize.
[2023-03-09 22:40:03] [INFO ] Deduced a trap composed of 326 places in 819 ms of which 2 ms to minimize.
[2023-03-09 22:40:04] [INFO ] Deduced a trap composed of 276 places in 793 ms of which 2 ms to minimize.
[2023-03-09 22:40:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6978 ms
[2023-03-09 22:40:06] [INFO ] Deduced a trap composed of 208 places in 273 ms of which 0 ms to minimize.
[2023-03-09 22:40:06] [INFO ] Deduced a trap composed of 202 places in 258 ms of which 0 ms to minimize.
[2023-03-09 22:40:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 873 ms
[2023-03-09 22:40:15] [INFO ] Deduced a trap composed of 207 places in 239 ms of which 1 ms to minimize.
[2023-03-09 22:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2023-03-09 22:40:19] [INFO ] Deduced a trap composed of 28 places in 811 ms of which 2 ms to minimize.
[2023-03-09 22:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 980 ms
[2023-03-09 22:40:20] [INFO ] After 46779ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :798 real:68
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 22:40:20] [INFO ] After 100018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :798 real:68
[2023-03-09 22:41:32] [INFO ] After 70756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 22:42:00] [INFO ] After 27574ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 22:42:00] [INFO ] After 27575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :865
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 22:42:00] [INFO ] After 100021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :865
Interrupted random walk after 331311 steps, including 42554 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 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 79 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 76 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 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 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 95 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 86 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 80 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 82 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 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 84 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 76 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 81 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 84 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 81 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 97 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 62 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 61 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 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 61 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 76 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 85 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 82 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 92 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 88 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 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 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 84 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 81 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 90 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 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 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 85 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 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 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 88 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 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 82 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 91 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 79 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 85 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 84 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 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 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 95 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 91 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 85 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 81 resets, run finished after 61 ms. (steps per millisecond=16 ) 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
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 59444 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:43:33] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-09 22:43:56] [INFO ] After 23526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 22:46:08] [INFO ] After 101377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 22:46:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:47:38] [INFO ] After 89949ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 22:47:39] [INFO ] Deduced a trap composed of 383 places in 518 ms of which 2 ms to minimize.
[2023-03-09 22:47:39] [INFO ] Deduced a trap composed of 406 places in 475 ms of which 1 ms to minimize.
[2023-03-09 22:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1295 ms
[2023-03-09 22:47:42] [INFO ] Deduced a trap composed of 382 places in 579 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 22:47:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:47:42] [INFO ] After 225325ms 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 30002 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 32 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 32 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 29 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 22:48:12] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-09 22:48:12] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:48:12] [INFO ] Invariants computation overflowed in 135 ms
[2023-03-09 22:48:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:48:13] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2023-03-09 22:48:13] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:48:13] [INFO ] Invariants computation overflowed in 227 ms
[2023-03-09 22:48:14] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2237 ms. Remains : 959/959 places, 900/900 transitions.
Incomplete random walk after 100000 steps, including 12851 resets, run finished after 9811 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:48:24] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-09 22:49:19] [INFO ] After 53798ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-09 22:49:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:49:35] [INFO ] After 15674ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-09 22:49:35] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2023-03-09 22:49:36] [INFO ] Deduced a trap composed of 150 places in 396 ms of which 1 ms to minimize.
[2023-03-09 22:49:36] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 1 ms to minimize.
[2023-03-09 22:49:36] [INFO ] Deduced a trap composed of 170 places in 234 ms of which 1 ms to minimize.
[2023-03-09 22:49:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1723 ms
[2023-03-09 22:49:39] [INFO ] Deduced a trap composed of 350 places in 755 ms of which 2 ms to minimize.
[2023-03-09 22:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1015 ms
[2023-03-09 22:49:41] [INFO ] Deduced a trap composed of 409 places in 761 ms of which 1 ms to minimize.
[2023-03-09 22:49:41] [INFO ] Deduced a trap composed of 352 places in 810 ms of which 2 ms to minimize.
[2023-03-09 22:49:42] [INFO ] Deduced a trap composed of 256 places in 511 ms of which 2 ms to minimize.
[2023-03-09 22:49:43] [INFO ] Deduced a trap composed of 312 places in 774 ms of which 1 ms to minimize.
[2023-03-09 22:49:43] [INFO ] Deduced a trap composed of 282 places in 480 ms of which 1 ms to minimize.
[2023-03-09 22:49:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3851 ms
[2023-03-09 22:49:45] [INFO ] Deduced a trap composed of 383 places in 789 ms of which 2 ms to minimize.
[2023-03-09 22:49:45] [INFO ] Deduced a trap composed of 376 places in 784 ms of which 2 ms to minimize.
[2023-03-09 22:49:46] [INFO ] Deduced a trap composed of 395 places in 763 ms of which 1 ms to minimize.
[2023-03-09 22:49:47] [INFO ] Deduced a trap composed of 383 places in 720 ms of which 2 ms to minimize.
[2023-03-09 22:49:48] [INFO ] Deduced a trap composed of 207 places in 727 ms of which 2 ms to minimize.
[2023-03-09 22:49:49] [INFO ] Deduced a trap composed of 395 places in 683 ms of which 2 ms to minimize.
[2023-03-09 22:49:49] [INFO ] Deduced a trap composed of 326 places in 601 ms of which 1 ms to minimize.
[2023-03-09 22:49:50] [INFO ] Deduced a trap composed of 276 places in 482 ms of which 1 ms to minimize.
[2023-03-09 22:49:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6366 ms
[2023-03-09 22:49:51] [INFO ] Deduced a trap composed of 208 places in 233 ms of which 1 ms to minimize.
[2023-03-09 22:49:51] [INFO ] Deduced a trap composed of 202 places in 237 ms of which 1 ms to minimize.
[2023-03-09 22:49:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 776 ms
[2023-03-09 22:50:00] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 1 ms to minimize.
[2023-03-09 22:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-09 22:50:04] [INFO ] Deduced a trap composed of 28 places in 690 ms of which 1 ms to minimize.
[2023-03-09 22:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 834 ms
[2023-03-09 22:50:04] [INFO ] After 44766ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :798 real:68
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 22:50:04] [INFO ] After 100024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :798 real:68
[2023-03-09 22:51:18] [INFO ] After 72619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 22:51:44] [INFO ] After 25682ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :848
[2023-03-09 22:51:44] [INFO ] After 25682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :848
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 22:51:44] [INFO ] After 100028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :848
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230758 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230758 steps, saw 116057 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:51:47] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-09 22:51:47] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:51:56] [INFO ] After 8799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:51:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:51:58] [INFO ] After 1458ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:51:58] [INFO ] Deduced a trap composed of 207 places in 222 ms of which 0 ms to minimize.
[2023-03-09 22:51:58] [INFO ] Deduced a trap composed of 191 places in 187 ms of which 0 ms to minimize.
[2023-03-09 22:51:59] [INFO ] Deduced a trap composed of 184 places in 244 ms of which 1 ms to minimize.
[2023-03-09 22:51:59] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 1 ms to minimize.
[2023-03-09 22:51:59] [INFO ] Deduced a trap composed of 182 places in 242 ms of which 1 ms to minimize.
[2023-03-09 22:52:00] [INFO ] Deduced a trap composed of 172 places in 292 ms of which 1 ms to minimize.
[2023-03-09 22:52:00] [INFO ] Deduced a trap composed of 173 places in 277 ms of which 1 ms to minimize.
[2023-03-09 22:52:01] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 1 ms to minimize.
[2023-03-09 22:52:01] [INFO ] Deduced a trap composed of 146 places in 335 ms of which 0 ms to minimize.
[2023-03-09 22:52:01] [INFO ] Deduced a trap composed of 181 places in 380 ms of which 1 ms to minimize.
[2023-03-09 22:52:02] [INFO ] Deduced a trap composed of 160 places in 325 ms of which 1 ms to minimize.
[2023-03-09 22:52:02] [INFO ] Deduced a trap composed of 136 places in 384 ms of which 1 ms to minimize.
[2023-03-09 22:52:03] [INFO ] Deduced a trap composed of 134 places in 358 ms of which 1 ms to minimize.
[2023-03-09 22:52:03] [INFO ] Deduced a trap composed of 152 places in 313 ms of which 2 ms to minimize.
[2023-03-09 22:52:04] [INFO ] Deduced a trap composed of 122 places in 344 ms of which 1 ms to minimize.
[2023-03-09 22:52:04] [INFO ] Deduced a trap composed of 117 places in 419 ms of which 1 ms to minimize.
[2023-03-09 22:52:05] [INFO ] Deduced a trap composed of 157 places in 383 ms of which 1 ms to minimize.
[2023-03-09 22:52:06] [INFO ] Deduced a trap composed of 190 places in 466 ms of which 1 ms to minimize.
[2023-03-09 22:52:07] [INFO ] Deduced a trap composed of 110 places in 413 ms of which 1 ms to minimize.
[2023-03-09 22:52:07] [INFO ] Deduced a trap composed of 158 places in 427 ms of which 1 ms to minimize.
[2023-03-09 22:52:08] [INFO ] Deduced a trap composed of 112 places in 455 ms of which 2 ms to minimize.
[2023-03-09 22:52:11] [INFO ] Deduced a trap composed of 86 places in 406 ms of which 2 ms to minimize.
[2023-03-09 22:52:11] [INFO ] Deduced a trap composed of 88 places in 506 ms of which 2 ms to minimize.
[2023-03-09 22:52:12] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 1 ms to minimize.
[2023-03-09 22:52:12] [INFO ] Deduced a trap composed of 76 places in 533 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.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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 22:52:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 22:52:12] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Graph (complete) has 1854 edges and 959 vertex of which 953 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 952 transition count 701
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 399 place count 755 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 754 transition count 700
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 400 place count 754 transition count 667
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 466 place count 721 transition count 667
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 5 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 760 place count 574 transition count 520
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 822 place count 543 transition count 520
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 543 transition count 452
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 958 place count 475 transition count 452
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 1024 place count 475 transition count 452
Applied a total of 1024 rules in 291 ms. Remains 475 /959 variables (removed 484) and now considering 452/900 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 475/959 places, 452/900 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 380613 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380613 steps, saw 190986 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2023-03-09 22:52:18] [INFO ] Computed 100 place invariants in 93 ms
[2023-03-09 22:52:18] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:52:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 22:52:18] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 80 ms returned sat
[2023-03-09 22:52:19] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:52:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:52:20] [INFO ] After 976ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2023-03-09 22:52:20] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2023-03-09 22:52:21] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 0 ms to minimize.
[2023-03-09 22:52:21] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2023-03-09 22:52:21] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2023-03-09 22:52:21] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:52:22] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 1 ms to minimize.
[2023-03-09 22:52:22] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2023-03-09 22:52:22] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2023-03-09 22:52:22] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:52:23] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 0 ms to minimize.
[2023-03-09 22:52:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2962 ms
[2023-03-09 22:52:23] [INFO ] After 4026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 22:52:23] [INFO ] After 4819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 32 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 30 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2023-03-09 22:52:25] [INFO ] Invariant cache hit.
[2023-03-09 22:52:28] [INFO ] Implicit Places using invariants in 3269 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 3274 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/475 places, 452/452 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 451
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 434 transition count 431
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 414 transition count 431
Applied a total of 42 rules in 45 ms. Remains 414 /435 variables (removed 21) and now considering 431/452 (removed 21) transitions.
// Phase 1: matrix 431 rows 414 cols
[2023-03-09 22:52:28] [INFO ] Computed 61 place invariants in 111 ms
[2023-03-09 22:52:29] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-09 22:52:29] [INFO ] Invariant cache hit.
[2023-03-09 22:52:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:52:47] [INFO ] Implicit Places using invariants and state equation in 17832 ms returned []
Implicit Place search using SMT with State Equation took 18584 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 414/475 places, 431/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21935 ms. Remains : 414/475 places, 431/452 transitions.
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 404701 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404701 steps, saw 202491 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:52:50] [INFO ] Invariant cache hit.
[2023-03-09 22:52:50] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:52:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 26 ms returned sat
[2023-03-09 22:52:50] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 13 ms returned sat
[2023-03-09 22:52:50] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:52:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:52:52] [INFO ] After 1207ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2023-03-09 22:52:52] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 1 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 1 ms to minimize.
[2023-03-09 22:52:53] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2023-03-09 22:52:54] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 1 ms to minimize.
[2023-03-09 22:52:54] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2023-03-09 22:52:54] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2023-03-09 22:52:54] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-09 22:52:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2633 ms
[2023-03-09 22:52:54] [INFO ] After 3908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-09 22:52:54] [INFO ] After 4500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 12 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 414/414 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 11 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2023-03-09 22:52:56] [INFO ] Invariant cache hit.
[2023-03-09 22:52:57] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-09 22:52:57] [INFO ] Invariant cache hit.
[2023-03-09 22:52:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:53:26] [INFO ] Implicit Places using invariants and state equation in 28721 ms returned []
Implicit Place search using SMT with State Equation took 29692 ms to find 0 implicit places.
[2023-03-09 22:53:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 22:53:26] [INFO ] Invariant cache hit.
[2023-03-09 22:53:27] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30368 ms. Remains : 414/414 places, 431/431 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224850 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224850 steps, saw 113102 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:53:30] [INFO ] Invariants computation overflowed in 200 ms
[2023-03-09 22:53:30] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:53:34] [INFO ] After 4031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:53:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:53:35] [INFO ] After 548ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:53:36] [INFO ] Deduced a trap composed of 7 places in 805 ms of which 1 ms to minimize.
[2023-03-09 22:53:37] [INFO ] Deduced a trap composed of 335 places in 864 ms of which 1 ms to minimize.
[2023-03-09 22:53:38] [INFO ] Deduced a trap composed of 347 places in 699 ms of which 1 ms to minimize.
[2023-03-09 22:53:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2618 ms
[2023-03-09 22:53:38] [INFO ] After 3216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 22:53:38] [INFO ] After 7464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Graph (complete) has 1854 edges and 959 vertex of which 953 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 952 transition count 700
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 400 place count 754 transition count 700
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 400 place count 754 transition count 667
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 466 place count 721 transition count 667
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 3 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 760 place count 574 transition count 520
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 822 place count 543 transition count 520
Free-agglomeration rule (complex) applied 67 times.
Iterating global reduction 2 with 67 rules applied. Total rules applied 889 place count 543 transition count 453
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 956 place count 476 transition count 453
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 1023 place count 476 transition count 453
Applied a total of 1023 rules in 109 ms. Remains 476 /959 variables (removed 483) and now considering 453/900 (removed 447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 476/959 places, 453/900 transitions.
Incomplete random walk after 10000 steps, including 1307 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 366451 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366451 steps, saw 183910 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 22:53:43] [INFO ] Computed 100 place invariants in 65 ms
[2023-03-09 22:53:43] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:53:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:53:43] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 92 ms returned sat
[2023-03-09 22:53:44] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:53:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:53:45] [INFO ] After 754ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:53:45] [INFO ] After 809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 22:53:45] [INFO ] After 1606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 24 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 23 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 22:53:47] [INFO ] Invariant cache hit.
[2023-03-09 22:53:50] [INFO ] Implicit Places using invariants in 3318 ms returned [15, 20, 45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 3320 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/476 places, 453/453 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 452
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 435 transition count 432
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 415 transition count 432
Applied a total of 42 rules in 51 ms. Remains 415 /436 variables (removed 21) and now considering 432/453 (removed 21) transitions.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:53:50] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 22:53:51] [INFO ] Implicit Places using invariants in 786 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:53:51] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 22:53:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:54:07] [INFO ] Implicit Places using invariants and state equation in 16158 ms returned []
Implicit Place search using SMT with State Equation took 16949 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 415/476 places, 432/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20344 ms. Remains : 415/476 places, 432/453 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 344904 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344904 steps, saw 172547 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:54:10] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 22:54:10] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:54:12] [INFO ] After 1731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:54:12] [INFO ] After 229ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:12] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 22:54:12] [INFO ] After 2141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 12 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 415/415 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 11 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:54:14] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 22:54:15] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:54:15] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 22:54:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:54:36] [INFO ] Implicit Places using invariants and state equation in 21342 ms returned []
Implicit Place search using SMT with State Equation took 21816 ms to find 0 implicit places.
[2023-03-09 22:54:36] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 22:54:36] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 22:54:37] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22310 ms. Remains : 415/415 places, 432/432 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 415 transition count 394
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 377 transition count 394
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 96 place count 357 transition count 374
Iterating global reduction 0 with 20 rules applied. Total rules applied 116 place count 357 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 356 transition count 373
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 356 transition count 371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 354 transition count 371
Applied a total of 122 rules in 90 ms. Remains 354 /415 variables (removed 61) and now considering 371/432 (removed 61) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 371 rows 354 cols
[2023-03-09 22:54:37] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 22:54:37] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:54:38] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:54:38] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:38] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-03-09 22:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 22:54:38] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:54:38] [INFO ] After 1374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 252999 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252999 steps, saw 127177 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 22:54:42] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-09 22:54:42] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:54:45] [INFO ] After 2814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 22:54:46] [INFO ] After 1183ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:47] [INFO ] Deduced a trap composed of 388 places in 882 ms of which 2 ms to minimize.
[2023-03-09 22:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1116 ms
[2023-03-09 22:54:47] [INFO ] After 2352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 22:54:47] [INFO ] After 5456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Graph (complete) has 1854 edges and 959 vertex of which 953 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 952 transition count 701
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 399 place count 755 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 754 transition count 700
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 400 place count 754 transition count 667
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 466 place count 721 transition count 667
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 3 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 760 place count 574 transition count 520
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 822 place count 543 transition count 520
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 543 transition count 452
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 958 place count 475 transition count 452
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 4 with 67 rules applied. Total rules applied 1025 place count 475 transition count 452
Applied a total of 1025 rules in 126 ms. Remains 475 /959 variables (removed 484) and now considering 452/900 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 475/959 places, 452/900 transitions.
Incomplete random walk after 10000 steps, including 1271 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 353810 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353810 steps, saw 177594 distinct states, run finished after 3007 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2023-03-09 22:54:52] [INFO ] Computed 100 place invariants in 86 ms
[2023-03-09 22:54:53] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:54:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 22:54:53] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 59 ms returned sat
[2023-03-09 22:54:53] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 22:54:56] [INFO ] After 2612ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:54:56] [INFO ] After 2673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 22:54:56] [INFO ] After 3309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 14 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2023-03-09 22:54:58] [INFO ] Invariant cache hit.
[2023-03-09 22:55:01] [INFO ] Implicit Places using invariants in 2858 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2862 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/475 places, 452/452 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 451
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 434 transition count 431
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 414 transition count 431
Applied a total of 42 rules in 32 ms. Remains 414 /435 variables (removed 21) and now considering 431/452 (removed 21) transitions.
// Phase 1: matrix 431 rows 414 cols
[2023-03-09 22:55:01] [INFO ] Computed 61 place invariants in 75 ms
[2023-03-09 22:55:02] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-09 22:55:02] [INFO ] Invariant cache hit.
[2023-03-09 22:55:02] [INFO ] State equation strengthened by 78 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15077328 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16168888 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="marciexred"
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 marciexred"
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 r152-smll-167819439200303"
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 ;