About the Execution of GreatSPN+red for Sudoku-PT-AN16
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530900693.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-PT-AN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530900693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.3M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717082986529
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:29:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 15:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:29:48] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2024-05-30 15:29:48] [INFO ] Transformed 4864 places.
[2024-05-30 15:29:48] [INFO ] Transformed 4096 transitions.
[2024-05-30 15:29:48] [INFO ] Found NUPN structural information;
[2024-05-30 15:29:48] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 36 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[256, 0, 256, 1, 1, 1, 0, 1, 0, 1, 1] Max Struct:[256, 4096, 256, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 15:29:48] [INFO ] Computed 768 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[4096, 1, 1]
RANDOM walk for 10000 steps (44 resets) in 3553 ms. (2 steps per ms)
FORMULA Sudoku-PT-AN16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 803 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[4096]
[2024-05-30 15:29:52] [INFO ] Invariant cache hit.
[2024-05-30 15:29:55] [INFO ] [Real]Absence check using 768 positive place invariants in 1423 ms returned sat
[2024-05-30 15:29:57] [INFO ] [Real]Absence check using state equation in 2611 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 285 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:29:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[235] Max Struct:[4096]
RANDOM walk for 87395 steps (386 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 64678 steps (0 resets) in 5049 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[4096]
[2024-05-30 15:30:33] [INFO ] Invariant cache hit.
[2024-05-30 15:30:36] [INFO ] [Real]Absence check using 768 positive place invariants in 2576 ms returned sat
[2024-05-30 15:30:53] [INFO ] [Real]Absence check using state equation in 16332 ms returned sat
[2024-05-30 15:30:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 193 ms.
[2024-05-30 15:30:54] [INFO ] Added : 0 causal constraints over 0 iterations in 609 ms. Result :sat
Minimization took 5719 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 159 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:31:00] [INFO ] Invariant cache hit.
[2024-05-30 15:31:12] [INFO ] Implicit Places using invariants in 12141 ms returned []
[2024-05-30 15:31:12] [INFO ] Invariant cache hit.
[2024-05-30 15:31:30] [INFO ] Implicit Places using invariants and state equation in 17951 ms returned []
Implicit Place search using SMT with State Equation took 30109 ms to find 0 implicit places.
[2024-05-30 15:31:30] [INFO ] Redundant transitions in 245 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30533 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 23931 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8067 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6993 ms. (5 steps per ms) remains 2/2 properties
Probabilistic random walk after 232502 steps, saw 232434 distinct states, run finished after 30038 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-30 15:32:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3719 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3611 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8628ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 168 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 19588 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4212 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3927 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 170283 steps, saw 170234 distinct states, run finished after 21112 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 15:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8054 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 768/4864 variables, 768/4864 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4864 variables, 768/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4864 variables, 0/5632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8960/8960 variables, and 10496 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45047 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 53785ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 122 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[235] Max Struct:[4096]
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4096]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4096]
[2024-05-30 15:33:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4096]
RANDOM walk for 10000 steps (44 resets) in 3388 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 778 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[4096]
[2024-05-30 15:33:46] [INFO ] Invariant cache hit.
[2024-05-30 15:33:49] [INFO ] [Real]Absence check using 768 positive place invariants in 2244 ms returned sat
[2024-05-30 15:33:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-05-30 15:33:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[232] Max Struct:[4096]
RANDOM walk for 87408 steps (386 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 65618 steps (0 resets) in 5010 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[4096]
[2024-05-30 15:34:26] [INFO ] Invariant cache hit.
[2024-05-30 15:34:29] [INFO ] [Real]Absence check using 768 positive place invariants in 2565 ms returned sat
[2024-05-30 15:34:43] [INFO ] [Real]Absence check using state equation in 13190 ms returned sat
[2024-05-30 15:34:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 170 ms.
[2024-05-30 15:34:43] [INFO ] Added : 0 causal constraints over 0 iterations in 503 ms. Result :sat
Minimization took 4677 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[4096]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[4096]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 81 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:34:48] [INFO ] Invariant cache hit.
[2024-05-30 15:35:01] [INFO ] Implicit Places using invariants in 12145 ms returned []
[2024-05-30 15:35:01] [INFO ] Invariant cache hit.
[2024-05-30 15:35:20] [INFO ] Implicit Places using invariants and state equation in 19073 ms returned []
Implicit Place search using SMT with State Equation took 31227 ms to find 0 implicit places.
[2024-05-30 15:35:20] [INFO ] Redundant transitions in 260 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31581 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 18166 ms. (2 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4222 ms. (9 steps per ms) remains 1/1 properties
[2024-05-30 15:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2371 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2251 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4898ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 14433 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4236 ms. (9 steps per ms) remains 1/1 properties
Probabilistic random walk after 143970 steps, saw 143928 distinct states, run finished after 12044 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-30 15:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 4096/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4096 variables, 0/4096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 4864/8960 variables, and 4864 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2781 ms.
Refiners :[Domain max(s): 4096/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3231ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[232] Max Struct:[4096]
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-01 in 128967 ms.
[2024-05-30 15:35:51] [INFO ] Flatten gal took : 338 ms
[2024-05-30 15:35:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2024-05-30 15:35:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 31 ms.
Total runtime 364229 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-PT-AN16
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4864
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.104s, Sys 0.015s]
SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.015s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 615
MODEL NAME: /home/mcc/execution/407/model
4864 places, 4096 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1717084476968
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="Sudoku-PT-AN16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-PT-AN16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530900693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;